17.89/11.07 YES 17.89/11.07 17.89/11.07 Ultimate: Cannot open display: 17.89/11.07 This is Ultimate 0.1.24-8dc7c08-m 17.89/11.07 [2019-03-28 11:53:04,893 INFO L170 SettingsManager]: Resetting all preferences to default values... 17.89/11.07 [2019-03-28 11:53:04,895 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 17.89/11.07 [2019-03-28 11:53:04,907 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 17.89/11.07 [2019-03-28 11:53:04,908 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 17.89/11.07 [2019-03-28 11:53:04,909 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 17.89/11.07 [2019-03-28 11:53:04,910 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 17.89/11.07 [2019-03-28 11:53:04,911 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 17.89/11.07 [2019-03-28 11:53:04,913 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 17.89/11.07 [2019-03-28 11:53:04,914 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 17.89/11.07 [2019-03-28 11:53:04,915 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 17.89/11.07 [2019-03-28 11:53:04,915 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 17.89/11.07 [2019-03-28 11:53:04,916 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 17.89/11.07 [2019-03-28 11:53:04,917 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 17.89/11.07 [2019-03-28 11:53:04,918 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 17.89/11.07 [2019-03-28 11:53:04,918 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 17.89/11.07 [2019-03-28 11:53:04,919 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 17.89/11.07 [2019-03-28 11:53:04,921 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 17.89/11.07 [2019-03-28 11:53:04,923 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 17.89/11.07 [2019-03-28 11:53:04,924 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 17.89/11.07 [2019-03-28 11:53:04,925 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 17.89/11.07 [2019-03-28 11:53:04,926 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 17.89/11.07 [2019-03-28 11:53:04,928 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 17.89/11.07 [2019-03-28 11:53:04,929 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 17.89/11.07 [2019-03-28 11:53:04,929 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 17.89/11.07 [2019-03-28 11:53:04,929 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 17.89/11.07 [2019-03-28 11:53:04,930 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 17.89/11.07 [2019-03-28 11:53:04,931 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 17.89/11.07 [2019-03-28 11:53:04,931 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 17.89/11.07 [2019-03-28 11:53:04,932 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 17.89/11.07 [2019-03-28 11:53:04,932 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 17.89/11.07 [2019-03-28 11:53:04,933 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 17.89/11.07 [2019-03-28 11:53:04,934 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 17.89/11.07 [2019-03-28 11:53:04,934 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 17.89/11.07 [2019-03-28 11:53:04,935 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 17.89/11.07 [2019-03-28 11:53:04,935 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 17.89/11.07 [2019-03-28 11:53:04,935 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 17.89/11.07 [2019-03-28 11:53:04,936 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 17.89/11.07 [2019-03-28 11:53:04,937 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 17.89/11.07 [2019-03-28 11:53:04,937 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 17.89/11.07 [2019-03-28 11:53:04,952 INFO L110 SettingsManager]: Loading preferences was successful 17.89/11.07 [2019-03-28 11:53:04,952 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 17.89/11.07 [2019-03-28 11:53:04,953 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 17.89/11.07 [2019-03-28 11:53:04,953 INFO L133 SettingsManager]: * Rewrite not-equals=true 17.89/11.07 [2019-03-28 11:53:04,953 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 17.89/11.07 [2019-03-28 11:53:04,954 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 17.89/11.07 [2019-03-28 11:53:04,954 INFO L133 SettingsManager]: * Use SBE=true 17.89/11.07 [2019-03-28 11:53:04,954 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 17.89/11.07 [2019-03-28 11:53:04,954 INFO L133 SettingsManager]: * Use old map elimination=false 17.89/11.07 [2019-03-28 11:53:04,954 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 17.89/11.07 [2019-03-28 11:53:04,955 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 17.89/11.07 [2019-03-28 11:53:04,955 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 17.89/11.07 [2019-03-28 11:53:04,955 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 17.89/11.07 [2019-03-28 11:53:04,955 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 17.89/11.07 [2019-03-28 11:53:04,955 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.89/11.07 [2019-03-28 11:53:04,956 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 17.89/11.07 [2019-03-28 11:53:04,956 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 17.89/11.07 [2019-03-28 11:53:04,956 INFO L133 SettingsManager]: * Check division by zero=IGNORE 17.89/11.07 [2019-03-28 11:53:04,956 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 17.89/11.07 [2019-03-28 11:53:04,956 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 17.89/11.07 [2019-03-28 11:53:04,957 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 17.89/11.07 [2019-03-28 11:53:04,957 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 17.89/11.07 [2019-03-28 11:53:04,957 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 17.89/11.07 [2019-03-28 11:53:04,957 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 17.89/11.07 [2019-03-28 11:53:04,957 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 17.89/11.07 [2019-03-28 11:53:04,958 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 17.89/11.07 [2019-03-28 11:53:04,958 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 17.89/11.07 [2019-03-28 11:53:04,958 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 17.89/11.07 [2019-03-28 11:53:04,958 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 17.89/11.07 [2019-03-28 11:53:04,984 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 17.89/11.07 [2019-03-28 11:53:05,001 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 17.89/11.07 [2019-03-28 11:53:05,005 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 17.89/11.07 [2019-03-28 11:53:05,006 INFO L271 PluginConnector]: Initializing CDTParser... 17.89/11.07 [2019-03-28 11:53:05,006 INFO L276 PluginConnector]: CDTParser initialized 17.89/11.07 [2019-03-28 11:53:05,007 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 17.89/11.07 [2019-03-28 11:53:05,099 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/e94a4d541b6742a690c433568afa775f/FLAG65b9843d5 17.89/11.07 [2019-03-28 11:53:05,695 INFO L307 CDTParser]: Found 1 translation units. 17.89/11.07 [2019-03-28 11:53:05,696 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 17.89/11.07 [2019-03-28 11:53:05,703 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/e94a4d541b6742a690c433568afa775f/FLAG65b9843d5 17.89/11.07 [2019-03-28 11:53:06,107 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/e94a4d541b6742a690c433568afa775f 17.89/11.07 [2019-03-28 11:53:06,118 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 17.89/11.07 [2019-03-28 11:53:06,120 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 17.89/11.07 [2019-03-28 11:53:06,121 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 17.89/11.07 [2019-03-28 11:53:06,121 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 17.89/11.07 [2019-03-28 11:53:06,124 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 17.89/11.07 [2019-03-28 11:53:06,125 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 11:53:06" (1/1) ... 17.89/11.07 [2019-03-28 11:53:06,129 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15472f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:53:06, skipping insertion in model container 17.89/11.07 [2019-03-28 11:53:06,129 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 11:53:06" (1/1) ... 17.89/11.07 [2019-03-28 11:53:06,137 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 17.89/11.07 [2019-03-28 11:53:06,153 INFO L176 MainTranslator]: Built tables and reachable declarations 17.89/11.07 [2019-03-28 11:53:06,311 INFO L206 PostProcessor]: Analyzing one entry point: main 17.89/11.07 [2019-03-28 11:53:06,315 INFO L191 MainTranslator]: Completed pre-run 17.89/11.07 [2019-03-28 11:53:06,333 INFO L206 PostProcessor]: Analyzing one entry point: main 17.89/11.07 [2019-03-28 11:53:06,348 INFO L195 MainTranslator]: Completed translation 17.89/11.07 [2019-03-28 11:53:06,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:53:06 WrapperNode 17.89/11.07 [2019-03-28 11:53:06,348 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 17.89/11.07 [2019-03-28 11:53:06,349 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 17.89/11.07 [2019-03-28 11:53:06,349 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 17.89/11.07 [2019-03-28 11:53:06,350 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 17.89/11.07 [2019-03-28 11:53:06,416 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:53:06" (1/1) ... 17.89/11.07 [2019-03-28 11:53:06,423 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:53:06" (1/1) ... 17.89/11.07 [2019-03-28 11:53:06,443 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 17.89/11.07 [2019-03-28 11:53:06,443 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 17.89/11.07 [2019-03-28 11:53:06,444 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 17.89/11.07 [2019-03-28 11:53:06,444 INFO L276 PluginConnector]: Boogie Preprocessor initialized 17.89/11.07 [2019-03-28 11:53:06,453 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:53:06" (1/1) ... 17.89/11.07 [2019-03-28 11:53:06,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:53:06" (1/1) ... 17.89/11.07 [2019-03-28 11:53:06,454 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:53:06" (1/1) ... 17.89/11.07 [2019-03-28 11:53:06,455 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:53:06" (1/1) ... 17.89/11.07 [2019-03-28 11:53:06,457 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:53:06" (1/1) ... 17.89/11.07 [2019-03-28 11:53:06,462 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:53:06" (1/1) ... 17.89/11.07 [2019-03-28 11:53:06,462 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:53:06" (1/1) ... 17.89/11.07 [2019-03-28 11:53:06,464 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 17.89/11.07 [2019-03-28 11:53:06,464 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 17.89/11.07 [2019-03-28 11:53:06,464 INFO L271 PluginConnector]: Initializing RCFGBuilder... 17.89/11.07 [2019-03-28 11:53:06,464 INFO L276 PluginConnector]: RCFGBuilder initialized 17.89/11.07 [2019-03-28 11:53:06,466 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:53:06" (1/1) ... 17.89/11.07 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.89/11.07 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 17.89/11.07 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 17.89/11.07 [2019-03-28 11:53:06,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 17.89/11.07 [2019-03-28 11:53:06,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 17.89/11.07 [2019-03-28 11:53:06,691 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 17.89/11.07 [2019-03-28 11:53:06,691 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. 17.89/11.07 [2019-03-28 11:53:06,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 11:53:06 BoogieIcfgContainer 17.89/11.07 [2019-03-28 11:53:06,693 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 17.89/11.07 [2019-03-28 11:53:06,693 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 17.89/11.07 [2019-03-28 11:53:06,693 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 17.89/11.07 [2019-03-28 11:53:06,695 INFO L276 PluginConnector]: BlockEncodingV2 initialized 17.89/11.07 [2019-03-28 11:53:06,696 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 11:53:06" (1/1) ... 17.89/11.07 [2019-03-28 11:53:06,713 INFO L313 BlockEncoder]: Initial Icfg 10 locations, 15 edges 17.89/11.07 [2019-03-28 11:53:06,715 INFO L258 BlockEncoder]: Using Remove infeasible edges 17.89/11.07 [2019-03-28 11:53:06,716 INFO L263 BlockEncoder]: Using Maximize final states 17.89/11.07 [2019-03-28 11:53:06,717 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 17.89/11.07 [2019-03-28 11:53:06,717 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 17.89/11.07 [2019-03-28 11:53:06,719 INFO L296 BlockEncoder]: Using Remove sink states 17.89/11.07 [2019-03-28 11:53:06,720 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 17.89/11.07 [2019-03-28 11:53:06,720 INFO L179 BlockEncoder]: Using Rewrite not-equals 17.89/11.07 [2019-03-28 11:53:06,738 INFO L185 BlockEncoder]: Using Use SBE 17.89/11.07 [2019-03-28 11:53:06,758 INFO L200 BlockEncoder]: SBE split 6 edges 17.89/11.07 [2019-03-28 11:53:06,763 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 17.89/11.07 [2019-03-28 11:53:06,764 INFO L71 MaximizeFinalStates]: 0 new accepting states 17.89/11.07 [2019-03-28 11:53:06,774 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding 17.89/11.07 [2019-03-28 11:53:06,776 INFO L70 RemoveSinkStates]: Removed 4 edges and 2 locations by removing sink states 17.89/11.07 [2019-03-28 11:53:06,777 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 17.89/11.07 [2019-03-28 11:53:06,777 INFO L71 MaximizeFinalStates]: 0 new accepting states 17.89/11.07 [2019-03-28 11:53:06,778 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 17.89/11.07 [2019-03-28 11:53:06,778 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 17.89/11.07 [2019-03-28 11:53:06,778 INFO L313 BlockEncoder]: Encoded RCFG 6 locations, 16 edges 17.89/11.07 [2019-03-28 11:53:06,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 11:53:06 BasicIcfg 17.89/11.07 [2019-03-28 11:53:06,779 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 17.89/11.07 [2019-03-28 11:53:06,780 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 17.89/11.07 [2019-03-28 11:53:06,780 INFO L271 PluginConnector]: Initializing TraceAbstraction... 17.89/11.07 [2019-03-28 11:53:06,783 INFO L276 PluginConnector]: TraceAbstraction initialized 17.89/11.07 [2019-03-28 11:53:06,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 11:53:06" (1/4) ... 17.89/11.07 [2019-03-28 11:53:06,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@178fa8bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 11:53:06, skipping insertion in model container 17.89/11.07 [2019-03-28 11:53:06,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:53:06" (2/4) ... 17.89/11.07 [2019-03-28 11:53:06,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@178fa8bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 11:53:06, skipping insertion in model container 17.89/11.07 [2019-03-28 11:53:06,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 11:53:06" (3/4) ... 17.89/11.07 [2019-03-28 11:53:06,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@178fa8bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 11:53:06, skipping insertion in model container 17.89/11.07 [2019-03-28 11:53:06,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 11:53:06" (4/4) ... 17.89/11.07 [2019-03-28 11:53:06,788 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 17.89/11.07 [2019-03-28 11:53:06,798 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 17.89/11.07 [2019-03-28 11:53:06,807 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 17.89/11.07 [2019-03-28 11:53:06,827 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 17.89/11.07 [2019-03-28 11:53:06,856 INFO L133 ementStrategyFactory]: Using default assertion order modulation 17.89/11.07 [2019-03-28 11:53:06,857 INFO L382 AbstractCegarLoop]: Interprodecural is true 17.89/11.07 [2019-03-28 11:53:06,857 INFO L383 AbstractCegarLoop]: Hoare is true 17.89/11.07 [2019-03-28 11:53:06,857 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 17.89/11.07 [2019-03-28 11:53:06,857 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 17.89/11.07 [2019-03-28 11:53:06,857 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 17.89/11.07 [2019-03-28 11:53:06,857 INFO L387 AbstractCegarLoop]: Difference is false 17.89/11.07 [2019-03-28 11:53:06,858 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 17.89/11.07 [2019-03-28 11:53:06,858 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 17.89/11.07 [2019-03-28 11:53:06,872 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. 17.89/11.07 [2019-03-28 11:53:06,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 17.89/11.07 [2019-03-28 11:53:06,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. 17.89/11.07 [2019-03-28 11:53:06,930 INFO L448 ceAbstractionStarter]: For program point L17(lines 17 27) no Hoare annotation was computed. 17.89/11.07 [2019-03-28 11:53:06,931 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 17.89/11.07 [2019-03-28 11:53:06,931 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 27) no Hoare annotation was computed. 17.89/11.07 [2019-03-28 11:53:06,931 INFO L451 ceAbstractionStarter]: At program point L25-2(lines 16 28) the Hoare annotation is: true 17.89/11.07 [2019-03-28 11:53:06,931 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 27) no Hoare annotation was computed. 17.89/11.07 [2019-03-28 11:53:06,931 INFO L448 ceAbstractionStarter]: For program point L18(lines 18 22) no Hoare annotation was computed. 17.89/11.07 [2019-03-28 11:53:06,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 11:53:06 BasicIcfg 17.89/11.07 [2019-03-28 11:53:06,940 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 17.89/11.07 [2019-03-28 11:53:06,941 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 17.89/11.07 [2019-03-28 11:53:06,941 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 17.89/11.07 [2019-03-28 11:53:06,944 INFO L276 PluginConnector]: BuchiAutomizer initialized 17.89/11.07 [2019-03-28 11:53:06,945 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 17.89/11.07 [2019-03-28 11:53:06,945 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 11:53:06" (1/5) ... 17.89/11.07 [2019-03-28 11:53:06,946 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26b6b09b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 11:53:06, skipping insertion in model container 17.89/11.07 [2019-03-28 11:53:06,946 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 17.89/11.07 [2019-03-28 11:53:06,946 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:53:06" (2/5) ... 17.89/11.07 [2019-03-28 11:53:06,947 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26b6b09b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 11:53:06, skipping insertion in model container 17.89/11.07 [2019-03-28 11:53:06,947 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 17.89/11.07 [2019-03-28 11:53:06,947 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 11:53:06" (3/5) ... 17.89/11.07 [2019-03-28 11:53:06,947 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26b6b09b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 11:53:06, skipping insertion in model container 17.89/11.07 [2019-03-28 11:53:06,947 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 17.89/11.07 [2019-03-28 11:53:06,948 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 11:53:06" (4/5) ... 17.89/11.07 [2019-03-28 11:53:06,948 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26b6b09b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 11:53:06, skipping insertion in model container 17.89/11.07 [2019-03-28 11:53:06,948 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 17.89/11.07 [2019-03-28 11:53:06,948 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 11:53:06" (5/5) ... 17.89/11.07 [2019-03-28 11:53:06,950 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 17.89/11.07 [2019-03-28 11:53:06,976 INFO L133 ementStrategyFactory]: Using default assertion order modulation 17.89/11.07 [2019-03-28 11:53:06,977 INFO L374 BuchiCegarLoop]: Interprodecural is true 17.89/11.07 [2019-03-28 11:53:06,977 INFO L375 BuchiCegarLoop]: Hoare is true 17.89/11.07 [2019-03-28 11:53:06,977 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 17.89/11.07 [2019-03-28 11:53:06,977 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 17.89/11.07 [2019-03-28 11:53:06,977 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 17.89/11.07 [2019-03-28 11:53:06,977 INFO L379 BuchiCegarLoop]: Difference is false 17.89/11.07 [2019-03-28 11:53:06,978 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 17.89/11.07 [2019-03-28 11:53:06,978 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 17.89/11.07 [2019-03-28 11:53:06,981 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. 17.89/11.07 [2019-03-28 11:53:07,000 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 17.89/11.07 [2019-03-28 11:53:07,000 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 17.89/11.07 [2019-03-28 11:53:07,000 INFO L119 BuchiIsEmpty]: Starting construction of run 17.89/11.07 [2019-03-28 11:53:07,007 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 17.89/11.07 [2019-03-28 11:53:07,008 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 17.89/11.07 [2019-03-28 11:53:07,008 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 17.89/11.07 [2019-03-28 11:53:07,008 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. 17.89/11.07 [2019-03-28 11:53:07,009 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 17.89/11.07 [2019-03-28 11:53:07,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 17.89/11.07 [2019-03-28 11:53:07,009 INFO L119 BuchiIsEmpty]: Starting construction of run 17.89/11.07 [2019-03-28 11:53:07,009 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 17.89/11.07 [2019-03-28 11:53:07,010 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 17.89/11.07 [2019-03-28 11:53:07,015 INFO L794 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue [40] ULTIMATE.startENTRY-->L25-2: Formula: (and (= v_ULTIMATE.start_main_~bn~0_1 |v_ULTIMATE.start_main_#t~nondet3_4|) (= v_ULTIMATE.start_main_~j~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~an~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~bn~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~an~0, ULTIMATE.start_main_~i~0] 5#L25-2true 17.89/11.07 [2019-03-28 11:53:07,015 INFO L796 eck$LassoCheckResult]: Loop: 5#L25-2true [60] L25-2-->L17: Formula: (and (<= v_ULTIMATE.start_main_~j~0_5 v_ULTIMATE.start_main_~bn~0_5) (<= v_ULTIMATE.start_main_~i~0_5 v_ULTIMATE.start_main_~an~0_5)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_5, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_5} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_5, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_5} AuxVars[] AssignedVars[] 4#L17true [66] L17-->L23: Formula: (> v_ULTIMATE.start_main_~i~0_9 v_ULTIMATE.start_main_~an~0_7) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 6#L23true [46] L23-->L25-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_10 (+ v_ULTIMATE.start_main_~i~0_11 1)) (<= v_ULTIMATE.start_main_~bn~0_8 v_ULTIMATE.start_main_~j~0_10) (<= v_ULTIMATE.start_main_~i~0_11 v_ULTIMATE.start_main_~an~0_8)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_8} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5#L25-2true 17.89/11.07 [2019-03-28 11:53:07,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.89/11.07 [2019-03-28 11:53:07,022 INFO L82 PathProgramCache]: Analyzing trace with hash 71, now seen corresponding path program 1 times 17.89/11.07 [2019-03-28 11:53:07,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.89/11.07 [2019-03-28 11:53:07,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.89/11.07 [2019-03-28 11:53:07,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.89/11.07 [2019-03-28 11:53:07,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.89/11.07 [2019-03-28 11:53:07,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.89/11.07 [2019-03-28 11:53:07,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.89/11.07 [2019-03-28 11:53:07,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.89/11.07 [2019-03-28 11:53:07,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.89/11.07 [2019-03-28 11:53:07,088 INFO L82 PathProgramCache]: Analyzing trace with hash 89543, now seen corresponding path program 1 times 17.89/11.07 [2019-03-28 11:53:07,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.89/11.07 [2019-03-28 11:53:07,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.89/11.07 [2019-03-28 11:53:07,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.89/11.07 [2019-03-28 11:53:07,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.89/11.07 [2019-03-28 11:53:07,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.89/11.07 [2019-03-28 11:53:07,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.89/11.07 [2019-03-28 11:53:07,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.89/11.07 [2019-03-28 11:53:07,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 17.89/11.07 [2019-03-28 11:53:07,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 17.89/11.07 [2019-03-28 11:53:07,145 INFO L811 eck$LassoCheckResult]: loop already infeasible 17.89/11.07 [2019-03-28 11:53:07,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 17.89/11.07 [2019-03-28 11:53:07,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 17.89/11.07 [2019-03-28 11:53:07,164 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. 17.89/11.07 [2019-03-28 11:53:07,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 17.89/11.07 [2019-03-28 11:53:07,234 INFO L93 Difference]: Finished difference Result 10 states and 26 transitions. 17.89/11.07 [2019-03-28 11:53:07,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 17.89/11.07 [2019-03-28 11:53:07,238 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 26 transitions. 17.89/11.07 [2019-03-28 11:53:07,240 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 17.89/11.07 [2019-03-28 11:53:07,244 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 26 transitions. 17.89/11.07 [2019-03-28 11:53:07,245 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 17.89/11.07 [2019-03-28 11:53:07,245 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 17.89/11.07 [2019-03-28 11:53:07,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 26 transitions. 17.89/11.07 [2019-03-28 11:53:07,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 17.89/11.07 [2019-03-28 11:53:07,247 INFO L706 BuchiCegarLoop]: Abstraction has 10 states and 26 transitions. 17.89/11.07 [2019-03-28 11:53:07,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 26 transitions. 17.89/11.07 [2019-03-28 11:53:07,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. 17.89/11.07 [2019-03-28 11:53:07,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 17.89/11.07 [2019-03-28 11:53:07,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 26 transitions. 17.89/11.07 [2019-03-28 11:53:07,277 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 26 transitions. 17.89/11.07 [2019-03-28 11:53:07,277 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 26 transitions. 17.89/11.07 [2019-03-28 11:53:07,277 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 17.89/11.07 [2019-03-28 11:53:07,277 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 26 transitions. 17.89/11.07 [2019-03-28 11:53:07,278 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 17.89/11.07 [2019-03-28 11:53:07,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 17.89/11.07 [2019-03-28 11:53:07,278 INFO L119 BuchiIsEmpty]: Starting construction of run 17.89/11.07 [2019-03-28 11:53:07,278 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 17.89/11.07 [2019-03-28 11:53:07,279 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 17.89/11.07 [2019-03-28 11:53:07,279 INFO L794 eck$LassoCheckResult]: Stem: 25#ULTIMATE.startENTRY [40] ULTIMATE.startENTRY-->L25-2: Formula: (and (= v_ULTIMATE.start_main_~bn~0_1 |v_ULTIMATE.start_main_#t~nondet3_4|) (= v_ULTIMATE.start_main_~j~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~an~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~bn~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~an~0, ULTIMATE.start_main_~i~0] 26#L25-2 17.89/11.07 [2019-03-28 11:53:07,279 INFO L796 eck$LassoCheckResult]: Loop: 26#L25-2 [60] L25-2-->L17: Formula: (and (<= v_ULTIMATE.start_main_~j~0_5 v_ULTIMATE.start_main_~bn~0_5) (<= v_ULTIMATE.start_main_~i~0_5 v_ULTIMATE.start_main_~an~0_5)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_5, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_5} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_5, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_5} AuxVars[] AssignedVars[] 27#L17 [67] L17-->L23: Formula: (> v_ULTIMATE.start_main_~j~0_9 v_ULTIMATE.start_main_~bn~0_7) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_7} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_7} AuxVars[] AssignedVars[] 28#L23 [46] L23-->L25-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_10 (+ v_ULTIMATE.start_main_~i~0_11 1)) (<= v_ULTIMATE.start_main_~bn~0_8 v_ULTIMATE.start_main_~j~0_10) (<= v_ULTIMATE.start_main_~i~0_11 v_ULTIMATE.start_main_~an~0_8)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_8} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 26#L25-2 17.89/11.07 [2019-03-28 11:53:07,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.89/11.07 [2019-03-28 11:53:07,280 INFO L82 PathProgramCache]: Analyzing trace with hash 71, now seen corresponding path program 2 times 17.89/11.07 [2019-03-28 11:53:07,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.89/11.07 [2019-03-28 11:53:07,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.89/11.07 [2019-03-28 11:53:07,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.89/11.07 [2019-03-28 11:53:07,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.89/11.07 [2019-03-28 11:53:07,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.89/11.07 [2019-03-28 11:53:07,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.89/11.07 [2019-03-28 11:53:07,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.89/11.07 [2019-03-28 11:53:07,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.89/11.07 [2019-03-28 11:53:07,287 INFO L82 PathProgramCache]: Analyzing trace with hash 89574, now seen corresponding path program 1 times 17.89/11.07 [2019-03-28 11:53:07,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.89/11.07 [2019-03-28 11:53:07,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.89/11.07 [2019-03-28 11:53:07,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.89/11.07 [2019-03-28 11:53:07,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 17.89/11.07 [2019-03-28 11:53:07,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.89/11.07 [2019-03-28 11:53:07,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.89/11.07 [2019-03-28 11:53:07,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.89/11.07 [2019-03-28 11:53:07,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 17.89/11.07 [2019-03-28 11:53:07,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 17.89/11.07 [2019-03-28 11:53:07,304 INFO L811 eck$LassoCheckResult]: loop already infeasible 17.89/11.07 [2019-03-28 11:53:07,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 17.89/11.07 [2019-03-28 11:53:07,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 17.89/11.07 [2019-03-28 11:53:07,304 INFO L87 Difference]: Start difference. First operand 10 states and 26 transitions. cyclomatic complexity: 17 Second operand 3 states. 17.89/11.07 [2019-03-28 11:53:07,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 17.89/11.07 [2019-03-28 11:53:07,356 INFO L93 Difference]: Finished difference Result 13 states and 30 transitions. 17.89/11.07 [2019-03-28 11:53:07,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 17.89/11.07 [2019-03-28 11:53:07,372 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 30 transitions. 17.89/11.07 [2019-03-28 11:53:07,373 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 17.89/11.07 [2019-03-28 11:53:07,373 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 30 transitions. 17.89/11.07 [2019-03-28 11:53:07,374 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 17.89/11.07 [2019-03-28 11:53:07,374 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 17.89/11.07 [2019-03-28 11:53:07,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 30 transitions. 17.89/11.07 [2019-03-28 11:53:07,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 17.89/11.07 [2019-03-28 11:53:07,374 INFO L706 BuchiCegarLoop]: Abstraction has 13 states and 30 transitions. 17.89/11.07 [2019-03-28 11:53:07,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 30 transitions. 17.89/11.07 [2019-03-28 11:53:07,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. 17.89/11.07 [2019-03-28 11:53:07,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. 17.89/11.07 [2019-03-28 11:53:07,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 30 transitions. 17.89/11.07 [2019-03-28 11:53:07,377 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 30 transitions. 17.89/11.07 [2019-03-28 11:53:07,377 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 30 transitions. 17.89/11.07 [2019-03-28 11:53:07,377 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 17.89/11.07 [2019-03-28 11:53:07,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 30 transitions. 17.89/11.07 [2019-03-28 11:53:07,378 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 17.89/11.07 [2019-03-28 11:53:07,378 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 17.89/11.07 [2019-03-28 11:53:07,378 INFO L119 BuchiIsEmpty]: Starting construction of run 17.89/11.07 [2019-03-28 11:53:07,379 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 17.89/11.07 [2019-03-28 11:53:07,379 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 17.89/11.07 [2019-03-28 11:53:07,379 INFO L794 eck$LassoCheckResult]: Stem: 54#ULTIMATE.startENTRY [40] ULTIMATE.startENTRY-->L25-2: Formula: (and (= v_ULTIMATE.start_main_~bn~0_1 |v_ULTIMATE.start_main_#t~nondet3_4|) (= v_ULTIMATE.start_main_~j~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~an~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~bn~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~an~0, ULTIMATE.start_main_~i~0] 55#L25-2 17.89/11.07 [2019-03-28 11:53:07,380 INFO L796 eck$LassoCheckResult]: Loop: 55#L25-2 [61] L25-2-->L17: Formula: (and (<= v_ULTIMATE.start_main_~bn~0_5 v_ULTIMATE.start_main_~j~0_5) (<= v_ULTIMATE.start_main_~i~0_5 v_ULTIMATE.start_main_~an~0_5)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_5, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_5} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_5, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_5} AuxVars[] AssignedVars[] 65#L17 [67] L17-->L23: Formula: (> v_ULTIMATE.start_main_~j~0_9 v_ULTIMATE.start_main_~bn~0_7) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_7} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_7} AuxVars[] AssignedVars[] 66#L23 [46] L23-->L25-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_10 (+ v_ULTIMATE.start_main_~i~0_11 1)) (<= v_ULTIMATE.start_main_~bn~0_8 v_ULTIMATE.start_main_~j~0_10) (<= v_ULTIMATE.start_main_~i~0_11 v_ULTIMATE.start_main_~an~0_8)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_8} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 55#L25-2 17.89/11.07 [2019-03-28 11:53:07,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.89/11.07 [2019-03-28 11:53:07,380 INFO L82 PathProgramCache]: Analyzing trace with hash 71, now seen corresponding path program 3 times 17.89/11.07 [2019-03-28 11:53:07,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.89/11.07 [2019-03-28 11:53:07,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.89/11.07 [2019-03-28 11:53:07,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.89/11.07 [2019-03-28 11:53:07,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.89/11.07 [2019-03-28 11:53:07,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.89/11.07 [2019-03-28 11:53:07,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.89/11.07 [2019-03-28 11:53:07,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.89/11.07 [2019-03-28 11:53:07,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.89/11.07 [2019-03-28 11:53:07,387 INFO L82 PathProgramCache]: Analyzing trace with hash 90535, now seen corresponding path program 1 times 17.89/11.07 [2019-03-28 11:53:07,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.89/11.07 [2019-03-28 11:53:07,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.89/11.07 [2019-03-28 11:53:07,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.89/11.07 [2019-03-28 11:53:07,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 17.89/11.07 [2019-03-28 11:53:07,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.89/11.07 [2019-03-28 11:53:07,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.89/11.07 [2019-03-28 11:53:07,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.89/11.07 [2019-03-28 11:53:07,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.89/11.07 [2019-03-28 11:53:07,396 INFO L82 PathProgramCache]: Analyzing trace with hash 2175905, now seen corresponding path program 1 times 17.89/11.07 [2019-03-28 11:53:07,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.89/11.07 [2019-03-28 11:53:07,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.89/11.07 [2019-03-28 11:53:07,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.89/11.07 [2019-03-28 11:53:07,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.89/11.07 [2019-03-28 11:53:07,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.89/11.07 [2019-03-28 11:53:07,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.89/11.07 [2019-03-28 11:53:07,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.89/11.07 [2019-03-28 11:53:07,444 INFO L216 LassoAnalysis]: Preferences: 17.89/11.07 [2019-03-28 11:53:07,446 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 17.89/11.07 [2019-03-28 11:53:07,446 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 17.89/11.07 [2019-03-28 11:53:07,446 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 17.89/11.07 [2019-03-28 11:53:07,446 INFO L127 ssoRankerPreferences]: Use exernal solver: true 17.89/11.07 [2019-03-28 11:53:07,446 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.89/11.07 [2019-03-28 11:53:07,446 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 17.89/11.07 [2019-03-28 11:53:07,447 INFO L130 ssoRankerPreferences]: Path of dumped script: 17.89/11.07 [2019-03-28 11:53:07,447 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 17.89/11.07 [2019-03-28 11:53:07,447 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 17.89/11.07 [2019-03-28 11:53:07,447 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 17.89/11.07 [2019-03-28 11:53:07,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.89/11.07 [2019-03-28 11:53:07,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.89/11.07 [2019-03-28 11:53:07,537 INFO L300 LassoAnalysis]: Preprocessing complete. 17.89/11.07 [2019-03-28 11:53:07,538 INFO L412 LassoAnalysis]: Checking for nontermination... 17.89/11.07 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.89/11.07 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.89/11.07 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.89/11.07 [2019-03-28 11:53:07,545 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.89/11.07 [2019-03-28 11:53:07,546 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.89/11.07 [2019-03-28 11:53:07,579 INFO L445 LassoAnalysis]: Proved nontermination for one component. 17.89/11.07 [2019-03-28 11:53:07,579 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0=1, ULTIMATE.start_main_~bn~0=0} Honda state: {ULTIMATE.start_main_~j~0=1, ULTIMATE.start_main_~bn~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 17.89/11.07 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.89/11.07 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.89/11.07 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.89/11.07 [2019-03-28 11:53:07,586 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.89/11.07 [2019-03-28 11:53:07,586 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.89/11.07 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.89/11.07 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.89/11.07 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.89/11.07 [2019-03-28 11:53:07,619 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 17.89/11.07 [2019-03-28 11:53:07,619 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.89/11.07 [2019-03-28 11:53:07,824 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 17.89/11.07 [2019-03-28 11:53:07,827 INFO L216 LassoAnalysis]: Preferences: 17.89/11.07 [2019-03-28 11:53:07,827 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 17.89/11.07 [2019-03-28 11:53:07,827 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 17.89/11.07 [2019-03-28 11:53:07,827 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 17.89/11.07 [2019-03-28 11:53:07,827 INFO L127 ssoRankerPreferences]: Use exernal solver: false 17.89/11.07 [2019-03-28 11:53:07,827 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 17.89/11.07 [2019-03-28 11:53:07,828 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 17.89/11.07 [2019-03-28 11:53:07,828 INFO L130 ssoRankerPreferences]: Path of dumped script: 17.89/11.07 [2019-03-28 11:53:07,828 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 17.89/11.07 [2019-03-28 11:53:07,828 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 17.89/11.07 [2019-03-28 11:53:07,828 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 17.89/11.07 [2019-03-28 11:53:07,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.89/11.07 [2019-03-28 11:53:07,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.89/11.07 [2019-03-28 11:53:07,873 INFO L300 LassoAnalysis]: Preprocessing complete. 17.89/11.07 [2019-03-28 11:53:07,879 INFO L497 LassoAnalysis]: Using template 'affine'. 17.89/11.07 [2019-03-28 11:53:07,880 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.89/11.07 Termination analysis: LINEAR_WITH_GUESSES 17.89/11.07 Number of strict supporting invariants: 0 17.89/11.07 Number of non-strict supporting invariants: 1 17.89/11.07 Consider only non-deceasing supporting invariants: true 17.89/11.07 Simplify termination arguments: true 17.89/11.07 Simplify supporting invariants: trueOverapproximate stem: false 17.89/11.07 [2019-03-28 11:53:07,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.89/11.07 [2019-03-28 11:53:07,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 17.89/11.07 [2019-03-28 11:53:07,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.89/11.07 [2019-03-28 11:53:07,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.89/11.07 [2019-03-28 11:53:07,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.89/11.07 [2019-03-28 11:53:07,885 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 17.89/11.07 [2019-03-28 11:53:07,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 17.89/11.07 [2019-03-28 11:53:07,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 17.89/11.07 [2019-03-28 11:53:07,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.89/11.07 Termination analysis: LINEAR_WITH_GUESSES 17.89/11.07 Number of strict supporting invariants: 0 17.89/11.07 Number of non-strict supporting invariants: 1 17.89/11.07 Consider only non-deceasing supporting invariants: true 17.89/11.07 Simplify termination arguments: true 17.89/11.07 Simplify supporting invariants: trueOverapproximate stem: false 17.89/11.07 [2019-03-28 11:53:07,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.89/11.07 [2019-03-28 11:53:07,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 17.89/11.07 [2019-03-28 11:53:07,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.89/11.07 [2019-03-28 11:53:07,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.89/11.07 [2019-03-28 11:53:07,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.89/11.07 [2019-03-28 11:53:07,892 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 17.89/11.07 [2019-03-28 11:53:07,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 17.89/11.07 [2019-03-28 11:53:07,897 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 17.89/11.07 [2019-03-28 11:53:07,903 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 17.89/11.07 [2019-03-28 11:53:07,904 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. 17.89/11.07 [2019-03-28 11:53:07,905 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 17.89/11.07 [2019-03-28 11:53:07,906 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 17.89/11.07 [2019-03-28 11:53:07,906 INFO L518 LassoAnalysis]: Proved termination. 17.89/11.07 [2019-03-28 11:53:07,906 INFO L520 LassoAnalysis]: Termination argument consisting of: 17.89/11.07 Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~an~0) = -2*ULTIMATE.start_main_~i~0 + 2*ULTIMATE.start_main_~an~0 + 1 17.89/11.07 Supporting invariants [] 17.89/11.07 [2019-03-28 11:53:07,908 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 17.89/11.07 [2019-03-28 11:53:07,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.89/11.07 [2019-03-28 11:53:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.89/11.07 [2019-03-28 11:53:07,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core 17.89/11.07 [2019-03-28 11:53:07,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.89/11.07 [2019-03-28 11:53:07,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.89/11.07 [2019-03-28 11:53:07,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core 17.89/11.07 [2019-03-28 11:53:07,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.89/11.07 [2019-03-28 11:53:07,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.89/11.07 [2019-03-28 11:53:07,992 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization 17.89/11.07 [2019-03-28 11:53:07,995 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates 17.89/11.07 [2019-03-28 11:53:07,996 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 13 states and 30 transitions. cyclomatic complexity: 18 Second operand 3 states. 17.89/11.07 [2019-03-28 11:53:08,093 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 13 states and 30 transitions. cyclomatic complexity: 18. Second operand 3 states. Result 29 states and 73 transitions. Complement of second has 6 states. 17.89/11.07 [2019-03-28 11:53:08,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states 17.89/11.07 [2019-03-28 11:53:08,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 17.89/11.07 [2019-03-28 11:53:08,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. 17.89/11.07 [2019-03-28 11:53:08,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 1 letters. Loop has 3 letters. 17.89/11.07 [2019-03-28 11:53:08,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.89/11.07 [2019-03-28 11:53:08,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 4 letters. Loop has 3 letters. 17.89/11.07 [2019-03-28 11:53:08,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.89/11.07 [2019-03-28 11:53:08,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 1 letters. Loop has 6 letters. 17.89/11.07 [2019-03-28 11:53:08,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.89/11.07 [2019-03-28 11:53:08,104 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 73 transitions. 17.89/11.07 [2019-03-28 11:53:08,107 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 17.89/11.07 [2019-03-28 11:53:08,108 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 73 transitions. 17.89/11.07 [2019-03-28 11:53:08,108 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 17.89/11.07 [2019-03-28 11:53:08,109 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 17.89/11.07 [2019-03-28 11:53:08,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 73 transitions. 17.89/11.07 [2019-03-28 11:53:08,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 17.89/11.07 [2019-03-28 11:53:08,109 INFO L706 BuchiCegarLoop]: Abstraction has 29 states and 73 transitions. 17.89/11.07 [2019-03-28 11:53:08,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 73 transitions. 17.89/11.07 [2019-03-28 11:53:08,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. 17.89/11.07 [2019-03-28 11:53:08,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. 17.89/11.07 [2019-03-28 11:53:08,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 68 transitions. 17.89/11.07 [2019-03-28 11:53:08,113 INFO L729 BuchiCegarLoop]: Abstraction has 26 states and 68 transitions. 17.89/11.07 [2019-03-28 11:53:08,113 INFO L609 BuchiCegarLoop]: Abstraction has 26 states and 68 transitions. 17.89/11.07 [2019-03-28 11:53:08,113 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 17.89/11.07 [2019-03-28 11:53:08,113 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 68 transitions. 17.89/11.07 [2019-03-28 11:53:08,114 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 17.89/11.07 [2019-03-28 11:53:08,115 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 17.89/11.07 [2019-03-28 11:53:08,115 INFO L119 BuchiIsEmpty]: Starting construction of run 17.89/11.07 [2019-03-28 11:53:08,115 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 17.89/11.07 [2019-03-28 11:53:08,115 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 17.89/11.07 [2019-03-28 11:53:08,116 INFO L794 eck$LassoCheckResult]: Stem: 132#ULTIMATE.startENTRY [40] ULTIMATE.startENTRY-->L25-2: Formula: (and (= v_ULTIMATE.start_main_~bn~0_1 |v_ULTIMATE.start_main_#t~nondet3_4|) (= v_ULTIMATE.start_main_~j~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~an~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~bn~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~an~0, ULTIMATE.start_main_~i~0] 133#L25-2 [60] L25-2-->L17: Formula: (and (<= v_ULTIMATE.start_main_~j~0_5 v_ULTIMATE.start_main_~bn~0_5) (<= v_ULTIMATE.start_main_~i~0_5 v_ULTIMATE.start_main_~an~0_5)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_5, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_5} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_5, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_5} AuxVars[] AssignedVars[] 134#L17 17.89/11.07 [2019-03-28 11:53:08,116 INFO L796 eck$LassoCheckResult]: Loop: 134#L17 [41] L17-->L18: Formula: (and (<= v_ULTIMATE.start_main_~j~0_6 v_ULTIMATE.start_main_~bn~0_6) (<= v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~an~0_6)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_6, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_6} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_6, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_6} AuxVars[] AssignedVars[] 135#L18 [68] L18-->L25-2: Formula: (and (> 0 |v_ULTIMATE.start_main_#t~nondet4_3|) (= v_ULTIMATE.start_main_~j~0_7 (+ v_ULTIMATE.start_main_~j~0_8 1))) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~j~0] 147#L25-2 [60] L25-2-->L17: Formula: (and (<= v_ULTIMATE.start_main_~j~0_5 v_ULTIMATE.start_main_~bn~0_5) (<= v_ULTIMATE.start_main_~i~0_5 v_ULTIMATE.start_main_~an~0_5)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_5, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_5} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_5, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_5} AuxVars[] AssignedVars[] 134#L17 17.89/11.07 [2019-03-28 11:53:08,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.89/11.07 [2019-03-28 11:53:08,116 INFO L82 PathProgramCache]: Analyzing trace with hash 2261, now seen corresponding path program 1 times 17.89/11.07 [2019-03-28 11:53:08,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.89/11.07 [2019-03-28 11:53:08,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.89/11.07 [2019-03-28 11:53:08,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.89/11.07 [2019-03-28 11:53:08,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.89/11.07 [2019-03-28 11:53:08,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.89/11.07 [2019-03-28 11:53:08,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.89/11.07 [2019-03-28 11:53:08,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.89/11.07 [2019-03-28 11:53:08,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.89/11.07 [2019-03-28 11:53:08,127 INFO L82 PathProgramCache]: Analyzing trace with hash 71360, now seen corresponding path program 1 times 17.89/11.07 [2019-03-28 11:53:08,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.89/11.07 [2019-03-28 11:53:08,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.89/11.07 [2019-03-28 11:53:08,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.89/11.07 [2019-03-28 11:53:08,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.89/11.07 [2019-03-28 11:53:08,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.89/11.07 [2019-03-28 11:53:08,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.89/11.07 [2019-03-28 11:53:08,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.89/11.07 [2019-03-28 11:53:08,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.89/11.07 [2019-03-28 11:53:08,135 INFO L82 PathProgramCache]: Analyzing trace with hash 67399020, now seen corresponding path program 1 times 17.89/11.07 [2019-03-28 11:53:08,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.89/11.07 [2019-03-28 11:53:08,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.89/11.07 [2019-03-28 11:53:08,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.89/11.07 [2019-03-28 11:53:08,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.89/11.07 [2019-03-28 11:53:08,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.89/11.07 [2019-03-28 11:53:08,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.89/11.07 [2019-03-28 11:53:08,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.89/11.07 [2019-03-28 11:53:08,174 INFO L216 LassoAnalysis]: Preferences: 17.89/11.07 [2019-03-28 11:53:08,174 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 17.89/11.07 [2019-03-28 11:53:08,174 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 17.89/11.07 [2019-03-28 11:53:08,175 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 17.89/11.07 [2019-03-28 11:53:08,175 INFO L127 ssoRankerPreferences]: Use exernal solver: true 17.89/11.07 [2019-03-28 11:53:08,175 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.89/11.07 [2019-03-28 11:53:08,175 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 17.89/11.07 [2019-03-28 11:53:08,175 INFO L130 ssoRankerPreferences]: Path of dumped script: 17.89/11.07 [2019-03-28 11:53:08,175 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 17.89/11.07 [2019-03-28 11:53:08,175 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 17.89/11.07 [2019-03-28 11:53:08,175 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 17.89/11.07 [2019-03-28 11:53:08,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.89/11.07 [2019-03-28 11:53:08,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.89/11.07 [2019-03-28 11:53:08,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.89/11.07 [2019-03-28 11:53:08,244 INFO L300 LassoAnalysis]: Preprocessing complete. 17.89/11.07 [2019-03-28 11:53:08,244 INFO L412 LassoAnalysis]: Checking for nontermination... 17.89/11.07 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.89/11.07 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.89/11.07 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.89/11.07 [2019-03-28 11:53:08,249 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.89/11.07 [2019-03-28 11:53:08,249 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.89/11.07 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.89/11.07 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.89/11.07 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.89/11.07 [2019-03-28 11:53:08,284 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 17.89/11.07 [2019-03-28 11:53:08,284 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.89/11.07 [2019-03-28 11:53:08,854 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 17.89/11.07 [2019-03-28 11:53:08,857 INFO L216 LassoAnalysis]: Preferences: 17.89/11.07 [2019-03-28 11:53:08,857 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 17.89/11.07 [2019-03-28 11:53:08,857 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 17.89/11.07 [2019-03-28 11:53:08,858 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 17.89/11.07 [2019-03-28 11:53:08,858 INFO L127 ssoRankerPreferences]: Use exernal solver: false 17.89/11.07 [2019-03-28 11:53:08,858 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 17.89/11.07 [2019-03-28 11:53:08,858 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 17.89/11.07 [2019-03-28 11:53:08,858 INFO L130 ssoRankerPreferences]: Path of dumped script: 17.89/11.07 [2019-03-28 11:53:08,858 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 17.89/11.07 [2019-03-28 11:53:08,859 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 17.89/11.07 [2019-03-28 11:53:08,859 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 17.89/11.07 [2019-03-28 11:53:08,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.89/11.07 [2019-03-28 11:53:08,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.89/11.07 [2019-03-28 11:53:08,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.89/11.07 [2019-03-28 11:53:08,896 INFO L300 LassoAnalysis]: Preprocessing complete. 17.89/11.07 [2019-03-28 11:53:08,896 INFO L497 LassoAnalysis]: Using template 'affine'. 17.89/11.07 [2019-03-28 11:53:08,896 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.89/11.07 Termination analysis: LINEAR_WITH_GUESSES 17.89/11.07 Number of strict supporting invariants: 0 17.89/11.07 Number of non-strict supporting invariants: 1 17.89/11.07 Consider only non-deceasing supporting invariants: true 17.89/11.07 Simplify termination arguments: true 17.89/11.07 Simplify supporting invariants: trueOverapproximate stem: false 17.89/11.07 [2019-03-28 11:53:08,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.89/11.07 [2019-03-28 11:53:08,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 17.89/11.07 [2019-03-28 11:53:08,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.89/11.07 [2019-03-28 11:53:08,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.89/11.07 [2019-03-28 11:53:08,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.89/11.07 [2019-03-28 11:53:08,899 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 17.89/11.07 [2019-03-28 11:53:08,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 17.89/11.07 [2019-03-28 11:53:08,904 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 17.89/11.07 [2019-03-28 11:53:08,910 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 17.89/11.07 [2019-03-28 11:53:08,910 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. 17.89/11.07 [2019-03-28 11:53:08,911 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 17.89/11.07 [2019-03-28 11:53:08,911 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 17.89/11.07 [2019-03-28 11:53:08,911 INFO L518 LassoAnalysis]: Proved termination. 17.89/11.07 [2019-03-28 11:53:08,911 INFO L520 LassoAnalysis]: Termination argument consisting of: 17.89/11.07 Ranking function f(ULTIMATE.start_main_~bn~0, ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~bn~0 - 1*ULTIMATE.start_main_~j~0 17.89/11.07 Supporting invariants [] 17.89/11.07 [2019-03-28 11:53:08,912 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 17.89/11.07 [2019-03-28 11:53:08,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.89/11.07 [2019-03-28 11:53:08,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.89/11.07 [2019-03-28 11:53:08,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core 17.89/11.07 [2019-03-28 11:53:08,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.89/11.07 [2019-03-28 11:53:08,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.89/11.07 [2019-03-28 11:53:08,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core 17.89/11.07 [2019-03-28 11:53:08,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.89/11.07 [2019-03-28 11:53:08,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.89/11.07 [2019-03-28 11:53:08,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.89/11.07 [2019-03-28 11:53:08,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core 17.89/11.07 [2019-03-28 11:53:08,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.89/11.07 [2019-03-28 11:53:08,988 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 17.89/11.07 [2019-03-28 11:53:08,988 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 17.89/11.07 [2019-03-28 11:53:08,988 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 26 states and 68 transitions. cyclomatic complexity: 45 Second operand 4 states. 17.89/11.07 [2019-03-28 11:53:09,108 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 26 states and 68 transitions. cyclomatic complexity: 45. Second operand 4 states. Result 86 states and 203 transitions. Complement of second has 10 states. 17.89/11.07 [2019-03-28 11:53:09,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 2 accepting loop states 17.89/11.07 [2019-03-28 11:53:09,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 17.89/11.07 [2019-03-28 11:53:09,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. 17.89/11.07 [2019-03-28 11:53:09,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 2 letters. Loop has 3 letters. 17.89/11.07 [2019-03-28 11:53:09,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.89/11.07 [2019-03-28 11:53:09,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 3 letters. 17.89/11.07 [2019-03-28 11:53:09,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.89/11.07 [2019-03-28 11:53:09,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 2 letters. Loop has 6 letters. 17.89/11.07 [2019-03-28 11:53:09,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.89/11.07 [2019-03-28 11:53:09,114 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 203 transitions. 17.89/11.07 [2019-03-28 11:53:09,118 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 17.89/11.07 [2019-03-28 11:53:09,119 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 26 states and 56 transitions. 17.89/11.07 [2019-03-28 11:53:09,119 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 17.89/11.07 [2019-03-28 11:53:09,119 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 17.89/11.07 [2019-03-28 11:53:09,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 56 transitions. 17.89/11.07 [2019-03-28 11:53:09,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 17.89/11.07 [2019-03-28 11:53:09,119 INFO L706 BuchiCegarLoop]: Abstraction has 26 states and 56 transitions. 17.89/11.07 [2019-03-28 11:53:09,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 56 transitions. 17.89/11.07 [2019-03-28 11:53:09,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. 17.89/11.07 [2019-03-28 11:53:09,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. 17.89/11.07 [2019-03-28 11:53:09,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 56 transitions. 17.89/11.07 [2019-03-28 11:53:09,124 INFO L729 BuchiCegarLoop]: Abstraction has 26 states and 56 transitions. 17.89/11.07 [2019-03-28 11:53:09,124 INFO L609 BuchiCegarLoop]: Abstraction has 26 states and 56 transitions. 17.89/11.07 [2019-03-28 11:53:09,124 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 17.89/11.07 [2019-03-28 11:53:09,124 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 56 transitions. 17.89/11.07 [2019-03-28 11:53:09,125 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 17.89/11.07 [2019-03-28 11:53:09,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 17.89/11.07 [2019-03-28 11:53:09,125 INFO L119 BuchiIsEmpty]: Starting construction of run 17.89/11.07 [2019-03-28 11:53:09,125 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 17.89/11.07 [2019-03-28 11:53:09,126 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 17.89/11.07 [2019-03-28 11:53:09,126 INFO L794 eck$LassoCheckResult]: Stem: 298#ULTIMATE.startENTRY [40] ULTIMATE.startENTRY-->L25-2: Formula: (and (= v_ULTIMATE.start_main_~bn~0_1 |v_ULTIMATE.start_main_#t~nondet3_4|) (= v_ULTIMATE.start_main_~j~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~an~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~bn~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~an~0, ULTIMATE.start_main_~i~0] 299#L25-2 [61] L25-2-->L17: Formula: (and (<= v_ULTIMATE.start_main_~bn~0_5 v_ULTIMATE.start_main_~j~0_5) (<= v_ULTIMATE.start_main_~i~0_5 v_ULTIMATE.start_main_~an~0_5)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_5, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_5} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_5, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_5} AuxVars[] AssignedVars[] 317#L17 17.89/11.07 [2019-03-28 11:53:09,126 INFO L796 eck$LassoCheckResult]: Loop: 317#L17 [41] L17-->L18: Formula: (and (<= v_ULTIMATE.start_main_~j~0_6 v_ULTIMATE.start_main_~bn~0_6) (<= v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~an~0_6)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_6, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_6} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_6, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_6, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_6} AuxVars[] AssignedVars[] 301#L18 [68] L18-->L25-2: Formula: (and (> 0 |v_ULTIMATE.start_main_#t~nondet4_3|) (= v_ULTIMATE.start_main_~j~0_7 (+ v_ULTIMATE.start_main_~j~0_8 1))) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~j~0] 311#L25-2 [61] L25-2-->L17: Formula: (and (<= v_ULTIMATE.start_main_~bn~0_5 v_ULTIMATE.start_main_~j~0_5) (<= v_ULTIMATE.start_main_~i~0_5 v_ULTIMATE.start_main_~an~0_5)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_5, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_5} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_5, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_5} AuxVars[] AssignedVars[] 317#L17 17.89/11.07 [2019-03-28 11:53:09,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.89/11.07 [2019-03-28 11:53:09,126 INFO L82 PathProgramCache]: Analyzing trace with hash 2262, now seen corresponding path program 1 times 17.89/11.07 [2019-03-28 11:53:09,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.89/11.07 [2019-03-28 11:53:09,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.89/11.07 [2019-03-28 11:53:09,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.89/11.07 [2019-03-28 11:53:09,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.89/11.07 [2019-03-28 11:53:09,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.89/11.07 [2019-03-28 11:53:09,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.89/11.07 [2019-03-28 11:53:09,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.89/11.07 [2019-03-28 11:53:09,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.89/11.07 [2019-03-28 11:53:09,136 INFO L82 PathProgramCache]: Analyzing trace with hash 71361, now seen corresponding path program 1 times 17.89/11.07 [2019-03-28 11:53:09,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.89/11.07 [2019-03-28 11:53:09,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.89/11.07 [2019-03-28 11:53:09,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.89/11.07 [2019-03-28 11:53:09,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.89/11.07 [2019-03-28 11:53:09,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.89/11.07 [2019-03-28 11:53:09,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.89/11.07 [2019-03-28 11:53:09,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.89/11.07 [2019-03-28 11:53:09,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.89/11.07 [2019-03-28 11:53:09,143 INFO L82 PathProgramCache]: Analyzing trace with hash 67428812, now seen corresponding path program 1 times 17.89/11.07 [2019-03-28 11:53:09,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.89/11.07 [2019-03-28 11:53:09,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.89/11.07 [2019-03-28 11:53:09,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.89/11.07 [2019-03-28 11:53:09,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.89/11.07 [2019-03-28 11:53:09,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.89/11.07 [2019-03-28 11:53:09,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.89/11.07 [2019-03-28 11:53:09,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.89/11.07 [2019-03-28 11:53:09,176 INFO L216 LassoAnalysis]: Preferences: 17.89/11.07 [2019-03-28 11:53:09,176 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 17.89/11.07 [2019-03-28 11:53:09,176 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 17.89/11.07 [2019-03-28 11:53:09,176 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 17.89/11.07 [2019-03-28 11:53:09,177 INFO L127 ssoRankerPreferences]: Use exernal solver: true 17.89/11.07 [2019-03-28 11:53:09,177 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.89/11.07 [2019-03-28 11:53:09,177 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 17.89/11.07 [2019-03-28 11:53:09,177 INFO L130 ssoRankerPreferences]: Path of dumped script: 17.89/11.07 [2019-03-28 11:53:09,177 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 17.89/11.07 [2019-03-28 11:53:09,177 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 17.89/11.07 [2019-03-28 11:53:09,177 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 17.89/11.07 [2019-03-28 11:53:09,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.89/11.07 [2019-03-28 11:53:09,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.89/11.07 [2019-03-28 11:53:09,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.89/11.07 [2019-03-28 11:53:09,224 INFO L300 LassoAnalysis]: Preprocessing complete. 17.89/11.07 [2019-03-28 11:53:09,225 INFO L412 LassoAnalysis]: Checking for nontermination... 17.89/11.07 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.89/11.07 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.89/11.07 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.89/11.07 [2019-03-28 11:53:09,229 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.89/11.07 [2019-03-28 11:53:09,230 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.89/11.07 [2019-03-28 11:53:09,257 INFO L445 LassoAnalysis]: Proved nontermination for one component. 17.89/11.07 [2019-03-28 11:53:09,258 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~an~0=0, ULTIMATE.start_main_~i~0=0} Honda state: {ULTIMATE.start_main_~an~0=0, ULTIMATE.start_main_~i~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 17.89/11.07 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.89/11.07 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.89/11.07 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.89/11.07 [2019-03-28 11:53:09,264 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.89/11.07 [2019-03-28 11:53:09,264 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.89/11.07 [2019-03-28 11:53:09,292 INFO L445 LassoAnalysis]: Proved nontermination for one component. 17.89/11.07 [2019-03-28 11:53:09,293 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4=-1} Honda state: {ULTIMATE.start_main_#t~nondet4=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 17.89/11.07 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.89/11.07 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.89/11.07 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.89/11.07 [2019-03-28 11:53:09,300 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.89/11.07 [2019-03-28 11:53:09,300 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.89/11.07 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.89/11.07 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.89/11.07 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.89/11.07 [2019-03-28 11:53:09,332 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 17.89/11.07 [2019-03-28 11:53:09,333 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.89/11.07 [2019-03-28 11:53:09,685 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 17.89/11.07 [2019-03-28 11:53:09,687 INFO L216 LassoAnalysis]: Preferences: 17.89/11.07 [2019-03-28 11:53:09,687 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 17.89/11.07 [2019-03-28 11:53:09,688 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 17.89/11.07 [2019-03-28 11:53:09,688 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 17.89/11.07 [2019-03-28 11:53:09,688 INFO L127 ssoRankerPreferences]: Use exernal solver: false 17.89/11.07 [2019-03-28 11:53:09,688 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 17.89/11.07 [2019-03-28 11:53:09,688 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 17.89/11.07 [2019-03-28 11:53:09,688 INFO L130 ssoRankerPreferences]: Path of dumped script: 17.89/11.07 [2019-03-28 11:53:09,688 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 17.89/11.07 [2019-03-28 11:53:09,688 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 17.89/11.07 [2019-03-28 11:53:09,689 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 17.89/11.07 [2019-03-28 11:53:09,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.89/11.07 [2019-03-28 11:53:09,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.89/11.07 [2019-03-28 11:53:09,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.89/11.07 [2019-03-28 11:53:09,725 INFO L300 LassoAnalysis]: Preprocessing complete. 17.89/11.07 [2019-03-28 11:53:09,726 INFO L497 LassoAnalysis]: Using template 'affine'. 17.89/11.07 [2019-03-28 11:53:09,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.89/11.07 Termination analysis: LINEAR_WITH_GUESSES 17.89/11.07 Number of strict supporting invariants: 0 17.89/11.07 Number of non-strict supporting invariants: 1 17.89/11.07 Consider only non-deceasing supporting invariants: true 17.89/11.07 Simplify termination arguments: true 17.89/11.07 Simplify supporting invariants: trueOverapproximate stem: false 17.89/11.07 [2019-03-28 11:53:09,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.89/11.07 [2019-03-28 11:53:09,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 17.89/11.07 [2019-03-28 11:53:09,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.89/11.07 [2019-03-28 11:53:09,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.89/11.07 [2019-03-28 11:53:09,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.89/11.07 [2019-03-28 11:53:09,728 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 17.89/11.07 [2019-03-28 11:53:09,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 17.89/11.07 [2019-03-28 11:53:09,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 17.89/11.07 [2019-03-28 11:53:09,729 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.89/11.07 Termination analysis: LINEAR_WITH_GUESSES 17.89/11.07 Number of strict supporting invariants: 0 17.89/11.07 Number of non-strict supporting invariants: 1 17.89/11.07 Consider only non-deceasing supporting invariants: true 17.89/11.07 Simplify termination arguments: true 17.89/11.07 Simplify supporting invariants: trueOverapproximate stem: false 17.89/11.07 [2019-03-28 11:53:09,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.89/11.07 [2019-03-28 11:53:09,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 17.89/11.07 [2019-03-28 11:53:09,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.89/11.07 [2019-03-28 11:53:09,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.89/11.07 [2019-03-28 11:53:09,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.89/11.07 [2019-03-28 11:53:09,731 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 17.89/11.07 [2019-03-28 11:53:09,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 17.89/11.07 [2019-03-28 11:53:09,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 17.89/11.07 [2019-03-28 11:53:09,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.89/11.07 Termination analysis: LINEAR_WITH_GUESSES 17.89/11.07 Number of strict supporting invariants: 0 17.89/11.07 Number of non-strict supporting invariants: 1 17.89/11.07 Consider only non-deceasing supporting invariants: true 17.89/11.07 Simplify termination arguments: true 17.89/11.07 Simplify supporting invariants: trueOverapproximate stem: false 17.89/11.07 [2019-03-28 11:53:09,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.89/11.07 [2019-03-28 11:53:09,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 17.89/11.07 [2019-03-28 11:53:09,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.89/11.07 [2019-03-28 11:53:09,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.89/11.07 [2019-03-28 11:53:09,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.89/11.07 [2019-03-28 11:53:09,736 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 17.89/11.07 [2019-03-28 11:53:09,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 17.89/11.07 [2019-03-28 11:53:09,740 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 17.89/11.07 [2019-03-28 11:53:09,743 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 17.89/11.07 [2019-03-28 11:53:09,743 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. 17.89/11.07 [2019-03-28 11:53:09,743 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 17.89/11.07 [2019-03-28 11:53:09,744 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 17.89/11.07 [2019-03-28 11:53:09,744 INFO L518 LassoAnalysis]: Proved termination. 17.89/11.07 [2019-03-28 11:53:09,744 INFO L520 LassoAnalysis]: Termination argument consisting of: 17.89/11.07 Ranking function f(ULTIMATE.start_main_~bn~0, ULTIMATE.start_main_~j~0) = 2*ULTIMATE.start_main_~bn~0 - 2*ULTIMATE.start_main_~j~0 + 1 17.89/11.07 Supporting invariants [] 17.89/11.07 [2019-03-28 11:53:09,744 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 17.89/11.07 [2019-03-28 11:53:09,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.89/11.07 [2019-03-28 11:53:09,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.89/11.07 [2019-03-28 11:53:09,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core 17.89/11.07 [2019-03-28 11:53:09,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.89/11.07 [2019-03-28 11:53:09,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.89/11.07 [2019-03-28 11:53:09,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core 17.89/11.07 [2019-03-28 11:53:09,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.89/11.07 [2019-03-28 11:53:09,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.89/11.07 [2019-03-28 11:53:09,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.89/11.07 [2019-03-28 11:53:09,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core 17.89/11.07 [2019-03-28 11:53:09,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.89/11.07 [2019-03-28 11:53:09,854 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 17.89/11.07 [2019-03-28 11:53:09,854 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 17.89/11.07 [2019-03-28 11:53:09,854 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 26 states and 56 transitions. cyclomatic complexity: 33 Second operand 4 states. 17.89/11.07 [2019-03-28 11:53:09,925 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 26 states and 56 transitions. cyclomatic complexity: 33. Second operand 4 states. Result 80 states and 164 transitions. Complement of second has 11 states. 17.89/11.07 [2019-03-28 11:53:09,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states 17.89/11.07 [2019-03-28 11:53:09,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 17.89/11.07 [2019-03-28 11:53:09,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. 17.89/11.07 [2019-03-28 11:53:09,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 2 letters. Loop has 3 letters. 17.89/11.07 [2019-03-28 11:53:09,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.89/11.07 [2019-03-28 11:53:09,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 5 letters. Loop has 3 letters. 17.89/11.07 [2019-03-28 11:53:09,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.89/11.07 [2019-03-28 11:53:09,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 2 letters. Loop has 6 letters. 17.89/11.07 [2019-03-28 11:53:09,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.89/11.07 [2019-03-28 11:53:09,930 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 164 transitions. 17.89/11.07 [2019-03-28 11:53:09,933 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 17.89/11.07 [2019-03-28 11:53:09,933 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 19 states and 31 transitions. 17.89/11.07 [2019-03-28 11:53:09,933 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 17.89/11.07 [2019-03-28 11:53:09,934 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 17.89/11.07 [2019-03-28 11:53:09,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 31 transitions. 17.89/11.07 [2019-03-28 11:53:09,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 17.89/11.07 [2019-03-28 11:53:09,934 INFO L706 BuchiCegarLoop]: Abstraction has 19 states and 31 transitions. 17.89/11.07 [2019-03-28 11:53:09,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 31 transitions. 17.89/11.07 [2019-03-28 11:53:09,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. 17.89/11.07 [2019-03-28 11:53:09,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 17.89/11.07 [2019-03-28 11:53:09,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 29 transitions. 17.89/11.07 [2019-03-28 11:53:09,936 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 29 transitions. 17.89/11.07 [2019-03-28 11:53:09,936 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 29 transitions. 17.89/11.07 [2019-03-28 11:53:09,936 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 17.89/11.07 [2019-03-28 11:53:09,937 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 29 transitions. 17.89/11.07 [2019-03-28 11:53:09,937 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 17.89/11.07 [2019-03-28 11:53:09,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 17.89/11.07 [2019-03-28 11:53:09,937 INFO L119 BuchiIsEmpty]: Starting construction of run 17.89/11.07 [2019-03-28 11:53:09,938 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 17.89/11.07 [2019-03-28 11:53:09,938 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 17.89/11.07 [2019-03-28 11:53:09,938 INFO L794 eck$LassoCheckResult]: Stem: 455#ULTIMATE.startENTRY [40] ULTIMATE.startENTRY-->L25-2: Formula: (and (= v_ULTIMATE.start_main_~bn~0_1 |v_ULTIMATE.start_main_#t~nondet3_4|) (= v_ULTIMATE.start_main_~j~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~an~0_1 |v_ULTIMATE.start_main_#t~nondet2_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_1, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_1, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet2_4|, |v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet3_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~bn~0, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~an~0, ULTIMATE.start_main_~i~0] 456#L25-2 [62] L25-2-->L17: Formula: (and (<= v_ULTIMATE.start_main_~j~0_5 v_ULTIMATE.start_main_~bn~0_5) (<= v_ULTIMATE.start_main_~an~0_5 v_ULTIMATE.start_main_~i~0_5)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_5, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_5} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_5, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_5} AuxVars[] AssignedVars[] 467#L17 17.89/11.07 [2019-03-28 11:53:09,938 INFO L796 eck$LassoCheckResult]: Loop: 467#L17 [66] L17-->L23: Formula: (> v_ULTIMATE.start_main_~i~0_9 v_ULTIMATE.start_main_~an~0_7) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} AuxVars[] AssignedVars[] 461#L23 [70] L23-->L25: Formula: (> v_ULTIMATE.start_main_~i~0_12 v_ULTIMATE.start_main_~an~0_9) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[] 462#L25 [53] L25-->L25-2: Formula: (and (<= v_ULTIMATE.start_main_~an~0_10 v_ULTIMATE.start_main_~i~0_13) (= v_ULTIMATE.start_main_~j~0_12 (+ v_ULTIMATE.start_main_~j~0_13 1)) (<= v_ULTIMATE.start_main_~j~0_13 v_ULTIMATE.start_main_~bn~0_10)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_13, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_10} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_10, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 466#L25-2 [62] L25-2-->L17: Formula: (and (<= v_ULTIMATE.start_main_~j~0_5 v_ULTIMATE.start_main_~bn~0_5) (<= v_ULTIMATE.start_main_~an~0_5 v_ULTIMATE.start_main_~i~0_5)) InVars {ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_5, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_5} OutVars{ULTIMATE.start_main_~an~0=v_ULTIMATE.start_main_~an~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_5, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_5, ULTIMATE.start_main_~bn~0=v_ULTIMATE.start_main_~bn~0_5} AuxVars[] AssignedVars[] 467#L17 17.89/11.07 [2019-03-28 11:53:09,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.89/11.07 [2019-03-28 11:53:09,939 INFO L82 PathProgramCache]: Analyzing trace with hash 2263, now seen corresponding path program 1 times 17.89/11.07 [2019-03-28 11:53:09,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.89/11.07 [2019-03-28 11:53:09,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.89/11.07 [2019-03-28 11:53:09,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.89/11.07 [2019-03-28 11:53:09,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.89/11.07 [2019-03-28 11:53:09,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.89/11.07 [2019-03-28 11:53:09,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.89/11.07 [2019-03-28 11:53:09,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.89/11.07 [2019-03-28 11:53:09,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.89/11.07 [2019-03-28 11:53:09,948 INFO L82 PathProgramCache]: Analyzing trace with hash 2958702, now seen corresponding path program 1 times 17.89/11.07 [2019-03-28 11:53:09,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.89/11.07 [2019-03-28 11:53:09,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.89/11.07 [2019-03-28 11:53:09,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.89/11.07 [2019-03-28 11:53:09,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.89/11.07 [2019-03-28 11:53:09,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.89/11.07 [2019-03-28 11:53:09,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.89/11.07 [2019-03-28 11:53:09,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.89/11.07 [2019-03-28 11:53:09,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.89/11.07 [2019-03-28 11:53:09,955 INFO L82 PathProgramCache]: Analyzing trace with hash 2091963204, now seen corresponding path program 1 times 17.89/11.07 [2019-03-28 11:53:09,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.89/11.07 [2019-03-28 11:53:09,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.89/11.07 [2019-03-28 11:53:09,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.89/11.07 [2019-03-28 11:53:09,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.89/11.07 [2019-03-28 11:53:09,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.89/11.07 [2019-03-28 11:53:09,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.89/11.07 [2019-03-28 11:53:09,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.89/11.07 [2019-03-28 11:53:09,990 INFO L216 LassoAnalysis]: Preferences: 17.89/11.07 [2019-03-28 11:53:09,990 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 17.89/11.07 [2019-03-28 11:53:09,991 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 17.89/11.07 [2019-03-28 11:53:09,991 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 17.89/11.07 [2019-03-28 11:53:09,991 INFO L127 ssoRankerPreferences]: Use exernal solver: true 17.89/11.07 [2019-03-28 11:53:09,991 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.89/11.07 [2019-03-28 11:53:09,991 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 17.89/11.07 [2019-03-28 11:53:09,991 INFO L130 ssoRankerPreferences]: Path of dumped script: 17.89/11.07 [2019-03-28 11:53:09,991 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop 17.89/11.07 [2019-03-28 11:53:09,991 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 17.89/11.07 [2019-03-28 11:53:09,992 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 17.89/11.07 [2019-03-28 11:53:09,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.89/11.07 [2019-03-28 11:53:09,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.89/11.07 [2019-03-28 11:53:10,033 INFO L300 LassoAnalysis]: Preprocessing complete. 17.89/11.07 [2019-03-28 11:53:10,033 INFO L412 LassoAnalysis]: Checking for nontermination... 17.89/11.07 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.89/11.07 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.89/11.07 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.89/11.07 [2019-03-28 11:53:10,038 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.89/11.07 [2019-03-28 11:53:10,038 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.89/11.07 [2019-03-28 11:53:10,065 INFO L445 LassoAnalysis]: Proved nontermination for one component. 17.89/11.07 [2019-03-28 11:53:10,065 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~an~0=0, ULTIMATE.start_main_~i~0=1} Honda state: {ULTIMATE.start_main_~an~0=0, ULTIMATE.start_main_~i~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 17.89/11.07 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.89/11.07 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.89/11.07 Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.89/11.07 [2019-03-28 11:53:10,072 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.89/11.07 [2019-03-28 11:53:10,072 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.89/11.07 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 17.89/11.07 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.89/11.07 Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.89/11.07 [2019-03-28 11:53:10,103 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 17.89/11.07 [2019-03-28 11:53:10,104 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.89/11.07 [2019-03-28 11:53:10,636 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 17.89/11.07 [2019-03-28 11:53:10,639 INFO L216 LassoAnalysis]: Preferences: 17.89/11.07 [2019-03-28 11:53:10,639 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 17.89/11.07 [2019-03-28 11:53:10,639 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 17.89/11.07 [2019-03-28 11:53:10,639 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 17.89/11.07 [2019-03-28 11:53:10,639 INFO L127 ssoRankerPreferences]: Use exernal solver: false 17.89/11.07 [2019-03-28 11:53:10,639 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 17.89/11.07 [2019-03-28 11:53:10,639 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 17.89/11.07 [2019-03-28 11:53:10,640 INFO L130 ssoRankerPreferences]: Path of dumped script: 17.89/11.07 [2019-03-28 11:53:10,640 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop 17.89/11.07 [2019-03-28 11:53:10,640 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 17.89/11.07 [2019-03-28 11:53:10,640 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 17.89/11.07 [2019-03-28 11:53:10,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.89/11.07 [2019-03-28 11:53:10,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.89/11.07 [2019-03-28 11:53:10,664 INFO L300 LassoAnalysis]: Preprocessing complete. 17.89/11.07 [2019-03-28 11:53:10,665 INFO L497 LassoAnalysis]: Using template 'affine'. 17.89/11.07 [2019-03-28 11:53:10,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.89/11.07 Termination analysis: LINEAR_WITH_GUESSES 17.89/11.07 Number of strict supporting invariants: 0 17.89/11.07 Number of non-strict supporting invariants: 1 17.89/11.07 Consider only non-deceasing supporting invariants: true 17.89/11.07 Simplify termination arguments: true 17.89/11.07 Simplify supporting invariants: trueOverapproximate stem: false 17.89/11.07 [2019-03-28 11:53:10,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.89/11.07 [2019-03-28 11:53:10,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 17.89/11.07 [2019-03-28 11:53:10,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.89/11.07 [2019-03-28 11:53:10,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.89/11.07 [2019-03-28 11:53:10,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.89/11.07 [2019-03-28 11:53:10,667 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 17.89/11.07 [2019-03-28 11:53:10,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 17.89/11.07 [2019-03-28 11:53:10,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 17.89/11.07 [2019-03-28 11:53:10,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.89/11.07 Termination analysis: LINEAR_WITH_GUESSES 17.89/11.07 Number of strict supporting invariants: 0 17.89/11.07 Number of non-strict supporting invariants: 1 17.89/11.07 Consider only non-deceasing supporting invariants: true 17.89/11.07 Simplify termination arguments: true 17.89/11.07 Simplify supporting invariants: trueOverapproximate stem: false 17.89/11.07 [2019-03-28 11:53:10,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.89/11.07 [2019-03-28 11:53:10,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 17.89/11.07 [2019-03-28 11:53:10,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.89/11.07 [2019-03-28 11:53:10,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.89/11.07 [2019-03-28 11:53:10,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.89/11.07 [2019-03-28 11:53:10,670 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 17.89/11.07 [2019-03-28 11:53:10,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 17.89/11.07 [2019-03-28 11:53:10,673 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 17.89/11.07 [2019-03-28 11:53:10,676 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 17.89/11.07 [2019-03-28 11:53:10,676 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. 17.89/11.07 [2019-03-28 11:53:10,677 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 17.89/11.07 [2019-03-28 11:53:10,677 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 17.89/11.07 [2019-03-28 11:53:10,677 INFO L518 LassoAnalysis]: Proved termination. 17.89/11.07 [2019-03-28 11:53:10,677 INFO L520 LassoAnalysis]: Termination argument consisting of: 17.89/11.07 Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~bn~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~bn~0 17.89/11.07 Supporting invariants [] 17.89/11.07 [2019-03-28 11:53:10,678 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 17.89/11.07 [2019-03-28 11:53:10,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.89/11.07 [2019-03-28 11:53:10,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.89/11.07 [2019-03-28 11:53:10,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core 17.89/11.07 [2019-03-28 11:53:10,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.89/11.07 [2019-03-28 11:53:10,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.89/11.07 [2019-03-28 11:53:10,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core 17.89/11.07 [2019-03-28 11:53:10,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.89/11.07 [2019-03-28 11:53:10,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.89/11.07 [2019-03-28 11:53:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.89/11.07 [2019-03-28 11:53:10,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core 17.89/11.07 [2019-03-28 11:53:10,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.89/11.07 [2019-03-28 11:53:10,751 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 17.89/11.07 [2019-03-28 11:53:10,752 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 17.89/11.07 [2019-03-28 11:53:10,752 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 17 states and 29 transitions. cyclomatic complexity: 15 Second operand 4 states. 17.89/11.07 [2019-03-28 11:53:10,810 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 17 states and 29 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 41 states and 71 transitions. Complement of second has 8 states. 17.89/11.07 [2019-03-28 11:53:10,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 2 accepting loop states 17.89/11.07 [2019-03-28 11:53:10,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 17.89/11.07 [2019-03-28 11:53:10,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. 17.89/11.07 [2019-03-28 11:53:10,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 2 letters. Loop has 4 letters. 17.89/11.07 [2019-03-28 11:53:10,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.89/11.07 [2019-03-28 11:53:10,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 6 letters. Loop has 4 letters. 17.89/11.07 [2019-03-28 11:53:10,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.89/11.07 [2019-03-28 11:53:10,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 2 letters. Loop has 8 letters. 17.89/11.07 [2019-03-28 11:53:10,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.89/11.07 [2019-03-28 11:53:10,814 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 71 transitions. 17.89/11.07 [2019-03-28 11:53:10,815 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 17.89/11.07 [2019-03-28 11:53:10,816 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. 17.89/11.07 [2019-03-28 11:53:10,816 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 17.89/11.07 [2019-03-28 11:53:10,816 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 17.89/11.07 [2019-03-28 11:53:10,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 17.89/11.07 [2019-03-28 11:53:10,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 17.89/11.07 [2019-03-28 11:53:10,816 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 17.89/11.07 [2019-03-28 11:53:10,816 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 17.89/11.07 [2019-03-28 11:53:10,816 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 17.89/11.07 [2019-03-28 11:53:10,816 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 17.89/11.07 [2019-03-28 11:53:10,817 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 17.89/11.07 [2019-03-28 11:53:10,817 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 17.89/11.07 [2019-03-28 11:53:10,817 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 17.89/11.07 [2019-03-28 11:53:10,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 11:53:10 BasicIcfg 17.89/11.07 [2019-03-28 11:53:10,823 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 17.89/11.07 [2019-03-28 11:53:10,823 INFO L168 Benchmark]: Toolchain (without parser) took 4704.74 ms. Allocated memory was 514.9 MB in the beginning and 572.5 MB in the end (delta: 57.7 MB). Free memory was 439.5 MB in the beginning and 366.3 MB in the end (delta: 73.2 MB). Peak memory consumption was 130.9 MB. Max. memory is 50.3 GB. 17.89/11.07 [2019-03-28 11:53:10,825 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 514.9 MB. Free memory is still 458.1 MB. There was no memory consumed. Max. memory is 50.3 GB. 17.89/11.07 [2019-03-28 11:53:10,825 INFO L168 Benchmark]: CACSL2BoogieTranslator took 228.15 ms. Allocated memory is still 514.9 MB. Free memory was 438.9 MB in the beginning and 428.4 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 50.3 GB. 17.89/11.07 [2019-03-28 11:53:10,826 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.00 ms. Allocated memory was 514.9 MB in the beginning and 538.4 MB in the end (delta: 23.6 MB). Free memory was 428.4 MB in the beginning and 508.5 MB in the end (delta: -80.0 MB). Peak memory consumption was 20.4 MB. Max. memory is 50.3 GB. 17.89/11.07 [2019-03-28 11:53:10,827 INFO L168 Benchmark]: Boogie Preprocessor took 20.35 ms. Allocated memory is still 538.4 MB. Free memory was 508.5 MB in the beginning and 507.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 17.89/11.07 [2019-03-28 11:53:10,827 INFO L168 Benchmark]: RCFGBuilder took 228.53 ms. Allocated memory is still 538.4 MB. Free memory was 506.9 MB in the beginning and 493.2 MB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 50.3 GB. 17.89/11.07 [2019-03-28 11:53:10,828 INFO L168 Benchmark]: BlockEncodingV2 took 86.16 ms. Allocated memory is still 538.4 MB. Free memory was 493.2 MB in the beginning and 487.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 17.89/11.07 [2019-03-28 11:53:10,828 INFO L168 Benchmark]: TraceAbstraction took 160.18 ms. Allocated memory is still 538.4 MB. Free memory was 487.2 MB in the beginning and 478.5 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 50.3 GB. 17.89/11.07 [2019-03-28 11:53:10,829 INFO L168 Benchmark]: BuchiAutomizer took 3882.08 ms. Allocated memory was 538.4 MB in the beginning and 572.5 MB in the end (delta: 34.1 MB). Free memory was 478.0 MB in the beginning and 366.3 MB in the end (delta: 111.7 MB). Peak memory consumption was 145.8 MB. Max. memory is 50.3 GB. 17.89/11.07 [2019-03-28 11:53:10,833 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 17.89/11.07 --- Results --- 17.89/11.07 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 17.89/11.07 - StatisticsResult: Initial Icfg 17.89/11.07 10 locations, 15 edges 17.89/11.07 - StatisticsResult: Encoded RCFG 17.89/11.07 6 locations, 16 edges 17.89/11.07 * Results from de.uni_freiburg.informatik.ultimate.core: 17.89/11.07 - StatisticsResult: Toolchain Benchmarks 17.89/11.07 Benchmark results are: 17.89/11.07 * CDTParser took 0.16 ms. Allocated memory is still 514.9 MB. Free memory is still 458.1 MB. There was no memory consumed. Max. memory is 50.3 GB. 17.89/11.07 * CACSL2BoogieTranslator took 228.15 ms. Allocated memory is still 514.9 MB. Free memory was 438.9 MB in the beginning and 428.4 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 50.3 GB. 17.89/11.07 * Boogie Procedure Inliner took 94.00 ms. Allocated memory was 514.9 MB in the beginning and 538.4 MB in the end (delta: 23.6 MB). Free memory was 428.4 MB in the beginning and 508.5 MB in the end (delta: -80.0 MB). Peak memory consumption was 20.4 MB. Max. memory is 50.3 GB. 17.89/11.07 * Boogie Preprocessor took 20.35 ms. Allocated memory is still 538.4 MB. Free memory was 508.5 MB in the beginning and 507.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 17.89/11.07 * RCFGBuilder took 228.53 ms. Allocated memory is still 538.4 MB. Free memory was 506.9 MB in the beginning and 493.2 MB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 50.3 GB. 17.89/11.07 * BlockEncodingV2 took 86.16 ms. Allocated memory is still 538.4 MB. Free memory was 493.2 MB in the beginning and 487.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 17.89/11.07 * TraceAbstraction took 160.18 ms. Allocated memory is still 538.4 MB. Free memory was 487.2 MB in the beginning and 478.5 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 50.3 GB. 17.89/11.07 * BuchiAutomizer took 3882.08 ms. Allocated memory was 538.4 MB in the beginning and 572.5 MB in the end (delta: 34.1 MB). Free memory was 478.0 MB in the beginning and 366.3 MB in the end (delta: 111.7 MB). Peak memory consumption was 145.8 MB. Max. memory is 50.3 GB. 17.89/11.07 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 17.89/11.07 - AllSpecificationsHoldResult: All specifications hold 17.89/11.07 We were not able to verify any specifiation because the program does not contain any specification. 17.89/11.07 - InvariantResult [Line: 16]: Loop Invariant 17.89/11.07 Derived loop invariant: 1 17.89/11.07 - StatisticsResult: Ultimate Automizer benchmark data 17.89/11.07 CFG has 1 procedures, 6 locations, 0 error locations. SAFE Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 1 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available 17.89/11.07 - StatisticsResult: Constructed decomposition of program 17.89/11.07 Your program was decomposed into 6 terminating modules (2 trivial, 0 deterministic, 4 nondeterministic). One nondeterministic module has affine ranking function -2 * i + 2 * an + 1 and consists of 4 locations. One nondeterministic module has affine ranking function bn + -1 * j and consists of 5 locations. One nondeterministic module has affine ranking function 2 * bn + -2 * j + 1 and consists of 4 locations. One nondeterministic module has affine ranking function -1 * j + bn and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. 17.89/11.07 - StatisticsResult: Timing statistics 17.89/11.07 BüchiAutomizer plugin needed 3.8s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 2.8s. Construction of modules took 0.2s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 26 states and ocurred in iteration 3. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 27 SDtfs, 147 SDslu, 28 SDs, 0 SdLazy, 247 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax100 hnf100 lsp71 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq156 hnf93 smp100 dnf100 smp100 tf112 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.9s 17.89/11.07 - TerminationAnalysisResult: Termination proven 17.89/11.07 Buchi Automizer proved that your program is terminating 17.89/11.07 RESULT: Ultimate proved your program to be correct! 17.89/11.07 !SESSION 2019-03-28 11:53:02.159 ----------------------------------------------- 17.89/11.07 eclipse.buildId=unknown 17.89/11.07 java.version=1.8.0_181 17.89/11.07 java.vendor=Oracle Corporation 17.89/11.07 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 17.89/11.07 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 17.89/11.07 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 17.89/11.07 17.89/11.07 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 11:53:11.065 17.89/11.07 !MESSAGE The workspace will exit with unsaved changes in this session. 17.89/11.07 Received shutdown request... 17.89/11.07 Ultimate: 17.89/11.07 GTK+ Version Check 17.89/11.07 EOF