./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/loops/trex01_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/loops/trex01_false-unreach-call_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b3a658a1fe592322f5aa7f1391ad7ef7d0545b11 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 22:59:25,413 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 22:59:25,416 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 22:59:25,432 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 22:59:25,434 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 22:59:25,435 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 22:59:25,439 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 22:59:25,451 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 22:59:25,453 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 22:59:25,455 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 22:59:25,458 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 22:59:25,459 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 22:59:25,460 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 22:59:25,463 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 22:59:25,470 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 22:59:25,474 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 22:59:25,476 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 22:59:25,480 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 22:59:25,484 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 22:59:25,487 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 22:59:25,489 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 22:59:25,492 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 22:59:25,498 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 22:59:25,500 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 22:59:25,500 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 22:59:25,501 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 22:59:25,502 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 22:59:25,505 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 22:59:25,506 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 22:59:25,509 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 22:59:25,510 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 22:59:25,511 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 22:59:25,511 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 22:59:25,512 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 22:59:25,512 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 22:59:25,515 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 22:59:25,517 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 22:59:25,541 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 22:59:25,542 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 22:59:25,544 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 22:59:25,545 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 22:59:25,545 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 22:59:25,546 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 22:59:25,546 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 22:59:25,546 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 22:59:25,546 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 22:59:25,546 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 22:59:25,547 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 22:59:25,547 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 22:59:25,547 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 22:59:25,547 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 22:59:25,547 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 22:59:25,547 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 22:59:25,548 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 22:59:25,548 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 22:59:25,548 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 22:59:25,548 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 22:59:25,548 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 22:59:25,548 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 22:59:25,549 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 22:59:25,549 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 22:59:25,549 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 22:59:25,549 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 22:59:25,549 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 22:59:25,549 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 22:59:25,550 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 22:59:25,550 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 22:59:25,550 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 22:59:25,551 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 22:59:25,551 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b3a658a1fe592322f5aa7f1391ad7ef7d0545b11 [2019-01-01 22:59:25,585 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 22:59:25,598 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 22:59:25,606 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 22:59:25,607 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 22:59:25,608 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 22:59:25,609 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loops/trex01_false-unreach-call_true-termination.i [2019-01-01 22:59:25,666 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0827d28a3/ce2c40773f1448449364742f8a53edeb/FLAG26f7a7a00 [2019-01-01 22:59:26,126 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 22:59:26,127 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loops/trex01_false-unreach-call_true-termination.i [2019-01-01 22:59:26,137 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0827d28a3/ce2c40773f1448449364742f8a53edeb/FLAG26f7a7a00 [2019-01-01 22:59:26,462 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0827d28a3/ce2c40773f1448449364742f8a53edeb [2019-01-01 22:59:26,467 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 22:59:26,469 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 22:59:26,470 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 22:59:26,471 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 22:59:26,478 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 22:59:26,479 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:59:26" (1/1) ... [2019-01-01 22:59:26,482 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53c28cb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:59:26, skipping insertion in model container [2019-01-01 22:59:26,483 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:59:26" (1/1) ... [2019-01-01 22:59:26,492 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 22:59:26,514 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 22:59:26,710 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:59:26,715 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 22:59:26,732 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:59:26,748 INFO L195 MainTranslator]: Completed translation [2019-01-01 22:59:26,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:59:26 WrapperNode [2019-01-01 22:59:26,749 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 22:59:26,750 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 22:59:26,750 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 22:59:26,750 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 22:59:26,758 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:59:26" (1/1) ... [2019-01-01 22:59:26,763 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:59:26" (1/1) ... [2019-01-01 22:59:26,787 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 22:59:26,787 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 22:59:26,787 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 22:59:26,787 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 22:59:26,797 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:59:26" (1/1) ... [2019-01-01 22:59:26,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:59:26" (1/1) ... [2019-01-01 22:59:26,799 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:59:26" (1/1) ... [2019-01-01 22:59:26,799 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:59:26" (1/1) ... [2019-01-01 22:59:26,802 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:59:26" (1/1) ... [2019-01-01 22:59:26,809 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:59:26" (1/1) ... [2019-01-01 22:59:26,811 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:59:26" (1/1) ... [2019-01-01 22:59:26,820 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 22:59:26,821 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 22:59:26,821 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 22:59:26,821 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 22:59:26,822 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:59:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:59:26,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 22:59:26,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 22:59:27,351 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 22:59:27,352 INFO L280 CfgBuilder]: Removed 16 assue(true) statements. [2019-01-01 22:59:27,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:59:27 BoogieIcfgContainer [2019-01-01 22:59:27,352 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 22:59:27,353 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 22:59:27,353 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 22:59:27,358 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 22:59:27,359 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:59:27,359 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 10:59:26" (1/3) ... [2019-01-01 22:59:27,360 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@214379e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:59:27, skipping insertion in model container [2019-01-01 22:59:27,360 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:59:27,360 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:59:26" (2/3) ... [2019-01-01 22:59:27,361 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@214379e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:59:27, skipping insertion in model container [2019-01-01 22:59:27,361 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:59:27,361 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:59:27" (3/3) ... [2019-01-01 22:59:27,363 INFO L375 chiAutomizerObserver]: Analyzing ICFG trex01_false-unreach-call_true-termination.i [2019-01-01 22:59:27,424 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 22:59:27,425 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 22:59:27,425 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 22:59:27,425 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 22:59:27,426 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 22:59:27,426 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 22:59:27,426 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 22:59:27,426 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 22:59:27,426 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 22:59:27,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2019-01-01 22:59:27,467 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-01 22:59:27,467 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:59:27,467 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:59:27,475 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 22:59:27,475 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-01 22:59:27,475 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 22:59:27,475 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2019-01-01 22:59:27,478 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-01 22:59:27,478 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:59:27,478 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:59:27,479 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 22:59:27,479 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-01 22:59:27,486 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet5, main_~c~1;main_~c~1 := main_#t~nondet5;havoc main_#t~nondet5; 13#L32true assume 0 != main_~c~1 % 256;f_#in~d := 1;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~c~0, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; 17#L12true assume !!(f_~k~0 <= 1073741823); 23#L15-1true [2019-01-01 22:59:27,487 INFO L796 eck$LassoCheckResult]: Loop: 23#L15-1true assume !!(f_~z~0 < f_~k~0);f_~z~0 := 2 * f_~z~0; 23#L15-1true [2019-01-01 22:59:27,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:27,492 INFO L82 PathProgramCache]: Analyzing trace with hash 30885, now seen corresponding path program 1 times [2019-01-01 22:59:27,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:59:27,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:59:27,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:27,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:59:27,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:27,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:27,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:27,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:27,600 INFO L82 PathProgramCache]: Analyzing trace with hash 49, now seen corresponding path program 1 times [2019-01-01 22:59:27,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:59:27,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:59:27,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:27,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:59:27,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:27,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:27,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:27,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:27,608 INFO L82 PathProgramCache]: Analyzing trace with hash 957453, now seen corresponding path program 1 times [2019-01-01 22:59:27,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:59:27,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:59:27,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:27,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:59:27,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:27,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:27,775 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:59:27,776 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:59:27,776 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:59:27,776 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:59:27,777 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:59:27,777 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:59:27,777 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:59:27,778 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:59:27,778 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_false-unreach-call_true-termination.i_Iteration1_Lasso [2019-01-01 22:59:27,778 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:59:27,778 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:59:27,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:27,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:27,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:27,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:27,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:27,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:27,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:27,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:28,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:28,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:28,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:28,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:28,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:28,397 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2019-01-01 22:59:28,590 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:59:28,591 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:59:28,603 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:59:28,603 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:59:28,615 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:59:28,616 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet3=0} Honda state: {ULTIMATE.start_f_#t~nondet3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:59:28,637 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:59:28,638 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:59:28,643 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:59:28,643 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet4=0} Honda state: {ULTIMATE.start_f_#t~nondet4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:59:28,674 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:59:28,675 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:59:28,705 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:59:28,705 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:59:40,781 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-01 22:59:40,788 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:59:40,789 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:59:40,789 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:59:40,789 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:59:40,789 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:59:40,789 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:59:40,789 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:59:40,789 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:59:40,791 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_false-unreach-call_true-termination.i_Iteration1_Lasso [2019-01-01 22:59:40,791 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:59:40,791 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:59:40,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:40,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:40,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:40,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:40,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:40,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:40,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:40,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:40,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:40,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:40,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:40,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:40,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:41,355 WARN L181 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2019-01-01 22:59:41,611 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-01 22:59:41,800 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-01 22:59:41,855 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:59:41,861 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:59:41,863 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:41,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:41,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:41,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:41,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:41,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:41,868 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:41,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:41,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:41,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:41,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:41,873 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:41,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:41,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:41,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:41,874 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:41,874 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:41,875 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:41,875 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:41,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:41,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:41,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:41,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:41,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:41,877 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:41,877 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:41,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:41,879 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:41,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:41,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:41,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:41,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:41,892 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:59:41,893 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:41,983 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:59:42,031 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-01 22:59:42,031 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 22:59:42,038 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:59:42,040 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-01 22:59:42,043 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:59:42,043 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~z~0, ULTIMATE.start_f_~k~0) = -1*ULTIMATE.start_f_~z~0 + 1*ULTIMATE.start_f_~k~0 Supporting invariants [1*ULTIMATE.start_f_~z~0 - 1 >= 0] [2019-01-01 22:59:42,072 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 22:59:42,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:42,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:59:42,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:59:42,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:59:42,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:59:42,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:59:42,442 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2019-01-01 22:59:42,444 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states. Second operand 3 states. [2019-01-01 22:59:42,574 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states.. Second operand 3 states. Result 69 states and 99 transitions. Complement of second has 7 states. [2019-01-01 22:59:42,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 22:59:42,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:59:42,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2019-01-01 22:59:42,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 70 transitions. Stem has 3 letters. Loop has 1 letters. [2019-01-01 22:59:42,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:59:42,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 70 transitions. Stem has 4 letters. Loop has 1 letters. [2019-01-01 22:59:42,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:59:42,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 70 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-01 22:59:42,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:59:42,586 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 99 transitions. [2019-01-01 22:59:42,592 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 11 [2019-01-01 22:59:42,598 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 23 states and 31 transitions. [2019-01-01 22:59:42,600 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-01-01 22:59:42,600 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-01-01 22:59:42,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 31 transitions. [2019-01-01 22:59:42,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:59:42,601 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-01-01 22:59:42,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 31 transitions. [2019-01-01 22:59:42,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 17. [2019-01-01 22:59:42,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-01 22:59:42,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2019-01-01 22:59:42,635 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-01-01 22:59:42,635 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-01-01 22:59:42,635 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 22:59:42,636 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2019-01-01 22:59:42,637 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2019-01-01 22:59:42,637 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:59:42,637 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:59:42,637 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 22:59:42,637 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-01 22:59:42,638 INFO L794 eck$LassoCheckResult]: Stem: 146#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5, main_~c~1;main_~c~1 := main_#t~nondet5;havoc main_#t~nondet5; 147#L32 assume !(0 != main_~c~1 % 256);f_#in~d := 2;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~c~0, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; 149#L12-1 assume !!(f_~k~0 <= 1073741823); 150#L15-4 [2019-01-01 22:59:42,638 INFO L796 eck$LassoCheckResult]: Loop: 150#L15-4 assume !!(f_~z~0 < f_~k~0);f_~z~0 := 2 * f_~z~0; 150#L15-4 [2019-01-01 22:59:42,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:42,638 INFO L82 PathProgramCache]: Analyzing trace with hash 32453, now seen corresponding path program 1 times [2019-01-01 22:59:42,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:59:42,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:59:42,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:42,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:59:42,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:42,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:42,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:42,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:42,651 INFO L82 PathProgramCache]: Analyzing trace with hash 98, now seen corresponding path program 1 times [2019-01-01 22:59:42,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:59:42,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:59:42,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:42,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:59:42,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:42,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:42,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:42,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:42,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1006110, now seen corresponding path program 1 times [2019-01-01 22:59:42,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:59:42,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:59:42,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:42,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:59:42,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:42,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:42,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:42,864 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:59:42,864 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:59:42,864 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:59:42,864 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:59:42,865 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:59:42,865 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:59:42,865 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:59:42,865 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:59:42,866 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_false-unreach-call_true-termination.i_Iteration2_Lasso [2019-01-01 22:59:42,866 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:59:42,866 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:59:42,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:42,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:42,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:42,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:42,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:42,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:42,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:42,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:42,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:42,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:42,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:42,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:42,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:43,222 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:59:43,222 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:59:43,230 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:59:43,230 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:59:43,234 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:59:43,234 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:59:43,255 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:59:43,256 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:59:43,260 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:59:43,260 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet2=0} Honda state: {ULTIMATE.start_f_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:59:43,281 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:59:43,282 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:59:43,290 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:59:43,290 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=0} Honda state: {ULTIMATE.start_main_#t~nondet5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:59:43,313 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:59:43,313 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:59:43,316 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:59:43,316 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet0=0} Honda state: {ULTIMATE.start_f_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:59:43,338 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:59:43,338 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:59:43,341 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:59:43,341 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet1=0} Honda state: {ULTIMATE.start_f_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:59:43,362 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:59:43,362 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:59:43,370 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:59:43,370 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~d=0, ULTIMATE.start_f_#in~d=0} Honda state: {ULTIMATE.start_f_~d=2, ULTIMATE.start_f_#in~d=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:59:43,392 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:59:43,392 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:59:43,395 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:59:43,395 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~c~0=0} Honda state: {ULTIMATE.start_f_~c~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:59:43,417 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:59:43,417 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:59:43,419 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:59:43,420 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet3=0} Honda state: {ULTIMATE.start_f_#t~nondet3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:59:43,444 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:59:43,444 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:59:43,447 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:59:43,448 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet4=0} Honda state: {ULTIMATE.start_f_#t~nondet4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:59:43,477 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:59:43,477 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:59:43,510 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:59:43,510 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:59:55,587 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-01 22:59:55,593 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:59:55,593 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:59:55,593 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:59:55,593 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:59:55,593 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:59:55,593 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:59:55,594 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:59:55,594 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:59:55,594 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_false-unreach-call_true-termination.i_Iteration2_Lasso [2019-01-01 22:59:55,594 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:59:55,594 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:59:55,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:55,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:55,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:55,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:55,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:55,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:55,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:55,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:55,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:55,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:55,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:55,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:55,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:55,776 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:59:55,776 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:59:55,777 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:55,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:55,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:55,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:55,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:55,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:55,781 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:55,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:55,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:55,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:55,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:55,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:55,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:55,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:55,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:55,787 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:55,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:55,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:55,790 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:55,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:55,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:55,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:55,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:55,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:55,792 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:55,792 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:55,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:55,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:55,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:55,797 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:55,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:55,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:55,800 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:55,800 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:55,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:55,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:55,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:55,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:55,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:55,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:55,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:55,804 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:55,806 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:55,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:55,808 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:55,808 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:55,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:55,809 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:55,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:55,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:55,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:55,812 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:55,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:55,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:55,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:55,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:55,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:55,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:55,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:55,821 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:59:55,821 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:55,896 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:59:55,922 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 22:59:55,924 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 22:59:55,924 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:59:55,930 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-01 22:59:55,930 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:59:55,930 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~z~0, ULTIMATE.start_f_~k~0) = -1*ULTIMATE.start_f_~z~0 + 1*ULTIMATE.start_f_~k~0 Supporting invariants [1*ULTIMATE.start_f_~z~0 - 1 >= 0] [2019-01-01 22:59:55,954 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 22:59:55,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:56,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:59:56,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:59:56,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:59:56,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:59:56,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:59:56,016 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2019-01-01 22:59:56,016 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 23 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-01-01 22:59:56,076 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 23 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 29 states and 40 transitions. Complement of second has 6 states. [2019-01-01 22:59:56,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 22:59:56,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:59:56,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2019-01-01 22:59:56,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 3 letters. Loop has 1 letters. [2019-01-01 22:59:56,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:59:56,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 4 letters. Loop has 1 letters. [2019-01-01 22:59:56,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:59:56,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-01 22:59:56,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:59:56,091 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 40 transitions. [2019-01-01 22:59:56,092 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2019-01-01 22:59:56,093 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 24 states and 33 transitions. [2019-01-01 22:59:56,094 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-01-01 22:59:56,094 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-01-01 22:59:56,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 33 transitions. [2019-01-01 22:59:56,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:59:56,095 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-01 22:59:56,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 33 transitions. [2019-01-01 22:59:56,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 18. [2019-01-01 22:59:56,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-01 22:59:56,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-01-01 22:59:56,098 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-01-01 22:59:56,098 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-01-01 22:59:56,098 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 22:59:56,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2019-01-01 22:59:56,099 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-01 22:59:56,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:59:56,099 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:59:56,100 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 22:59:56,100 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:59:56,100 INFO L794 eck$LassoCheckResult]: Stem: 235#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5, main_~c~1;main_~c~1 := main_#t~nondet5;havoc main_#t~nondet5; 236#L32 assume 0 != main_~c~1 % 256;f_#in~d := 1;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~c~0, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; 237#L12 assume !!(f_~k~0 <= 1073741823); 241#L15-1 assume !(f_~z~0 < f_~k~0); 242#L15-2 __VERIFIER_assert_#in~cond := (if f_~z~0 >= 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 243#L3 assume !(0 == __VERIFIER_assert_~cond); 230#L20-2 [2019-01-01 22:59:56,102 INFO L796 eck$LassoCheckResult]: Loop: 230#L20-2 assume !!(f_~x~0 > 0 && f_~y~0 > 0);f_~c~0 := f_#t~nondet3;havoc f_#t~nondet3; 231#L20 assume !(0 != f_~c~0 % 256);f_~y~0 := f_~y~0 - f_~d; 230#L20-2 [2019-01-01 22:59:56,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:56,102 INFO L82 PathProgramCache]: Analyzing trace with hash 920111122, now seen corresponding path program 1 times [2019-01-01 22:59:56,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:59:56,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:59:56,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:56,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:59:56,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:59:56,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:59:56,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:59:56,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:59:56,175 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:59:56,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:56,176 INFO L82 PathProgramCache]: Analyzing trace with hash 2248, now seen corresponding path program 1 times [2019-01-01 22:59:56,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:59:56,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:59:56,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:56,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:59:56,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:56,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:56,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:56,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 22:59:56,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 22:59:56,227 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-01-01 22:59:56,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:59:56,299 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2019-01-01 22:59:56,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 22:59:56,300 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 27 transitions. [2019-01-01 22:59:56,301 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-01 22:59:56,302 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 18 states and 23 transitions. [2019-01-01 22:59:56,302 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-01 22:59:56,303 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-01-01 22:59:56,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2019-01-01 22:59:56,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:59:56,303 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-01-01 22:59:56,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2019-01-01 22:59:56,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-01-01 22:59:56,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-01 22:59:56,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2019-01-01 22:59:56,307 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-01-01 22:59:56,307 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-01-01 22:59:56,307 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 22:59:56,307 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2019-01-01 22:59:56,308 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-01 22:59:56,308 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:59:56,308 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:59:56,308 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:59:56,308 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:59:56,309 INFO L794 eck$LassoCheckResult]: Stem: 284#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5, main_~c~1;main_~c~1 := main_#t~nondet5;havoc main_#t~nondet5; 285#L32 assume 0 != main_~c~1 % 256;f_#in~d := 1;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~c~0, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; 286#L12 assume !!(f_~k~0 <= 1073741823); 290#L15-1 assume !!(f_~z~0 < f_~k~0);f_~z~0 := 2 * f_~z~0; 293#L15-1 assume !(f_~z~0 < f_~k~0); 291#L15-2 __VERIFIER_assert_#in~cond := (if f_~z~0 >= 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 292#L3 assume !(0 == __VERIFIER_assert_~cond); 279#L20-2 [2019-01-01 22:59:56,309 INFO L796 eck$LassoCheckResult]: Loop: 279#L20-2 assume !!(f_~x~0 > 0 && f_~y~0 > 0);f_~c~0 := f_#t~nondet3;havoc f_#t~nondet3; 280#L20 assume !(0 != f_~c~0 % 256);f_~y~0 := f_~y~0 - f_~d; 279#L20-2 [2019-01-01 22:59:56,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:56,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1541272662, now seen corresponding path program 1 times [2019-01-01 22:59:56,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:59:56,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:59:56,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:56,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:59:56,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:56,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:56,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:56,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:56,325 INFO L82 PathProgramCache]: Analyzing trace with hash 2248, now seen corresponding path program 2 times [2019-01-01 22:59:56,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:59:56,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:59:56,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:56,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:59:56,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:56,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:56,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:56,334 INFO L82 PathProgramCache]: Analyzing trace with hash 600690225, now seen corresponding path program 1 times [2019-01-01 22:59:56,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:59:56,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:59:56,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:56,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:59:56,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:56,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:56,605 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:59:56,605 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:59:56,605 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:59:56,605 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:59:56,606 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:59:56,606 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:59:56,606 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:59:56,606 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:59:56,606 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_false-unreach-call_true-termination.i_Iteration4_Lasso [2019-01-01 22:59:56,607 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:59:56,607 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:59:56,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:56,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:56,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:56,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:56,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:56,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:56,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:56,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:56,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:56,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:56,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:56,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:56,893 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:59:56,894 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:59:56,900 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:59:56,900 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:59:56,908 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:59:56,908 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~c~0=-256, ULTIMATE.start_f_#t~nondet3=-256} Honda state: {ULTIMATE.start_f_~c~0=-256, ULTIMATE.start_f_#t~nondet3=-256} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:59:56,928 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:59:56,928 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:59:56,951 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:59:56,951 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:59:57,050 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 22:59:57,053 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:59:57,053 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:59:57,053 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:59:57,053 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:59:57,053 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:59:57,053 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:59:57,053 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:59:57,054 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:59:57,055 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_false-unreach-call_true-termination.i_Iteration4_Lasso [2019-01-01 22:59:57,055 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:59:57,055 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:59:57,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:57,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:57,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:57,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:57,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:57,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:57,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:57,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:57,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:57,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:57,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:57,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:57,284 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:59:57,284 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:59:57,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:57,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:57,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:57,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:57,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:57,287 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:59:57,287 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:57,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:57,292 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:57,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:57,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:57,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:57,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:57,298 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:59:57,298 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:57,310 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:59:57,316 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 22:59:57,316 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 22:59:57,317 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:59:57,319 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-01 22:59:57,319 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:59:57,319 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~y~0) = 1*ULTIMATE.start_f_~y~0 Supporting invariants [1*ULTIMATE.start_f_~d - 1 >= 0] [2019-01-01 22:59:57,345 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 22:59:57,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:57,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:59:57,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:59:57,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:59:57,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:59:57,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:59:57,488 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-01 22:59:57,488 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 23 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-01-01 22:59:57,523 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 23 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 24 states and 31 transitions. Complement of second has 6 states. [2019-01-01 22:59:57,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 22:59:57,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 22:59:57,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2019-01-01 22:59:57,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-01 22:59:57,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:59:57,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-01 22:59:57,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:59:57,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 7 letters. Loop has 4 letters. [2019-01-01 22:59:57,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:59:57,528 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. [2019-01-01 22:59:57,528 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-01 22:59:57,531 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 23 states and 30 transitions. [2019-01-01 22:59:57,531 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-01-01 22:59:57,531 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-01-01 22:59:57,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2019-01-01 22:59:57,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:59:57,531 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-01-01 22:59:57,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2019-01-01 22:59:57,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-01-01 22:59:57,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-01 22:59:57,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2019-01-01 22:59:57,534 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2019-01-01 22:59:57,534 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2019-01-01 22:59:57,534 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 22:59:57,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 29 transitions. [2019-01-01 22:59:57,535 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-01 22:59:57,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:59:57,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:59:57,536 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:59:57,536 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:59:57,536 INFO L794 eck$LassoCheckResult]: Stem: 388#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5, main_~c~1;main_~c~1 := main_#t~nondet5;havoc main_#t~nondet5; 389#L32 assume !(0 != main_~c~1 % 256);f_#in~d := 2;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~c~0, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; 391#L12-1 assume !!(f_~k~0 <= 1073741823); 392#L15-4 assume !!(f_~z~0 < f_~k~0);f_~z~0 := 2 * f_~z~0; 393#L15-4 assume !(f_~z~0 < f_~k~0); 386#L15-5 __VERIFIER_assert_#in~cond := (if f_~z~0 >= 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 387#L3-3 assume !(0 == __VERIFIER_assert_~cond); 377#L20-5 [2019-01-01 22:59:57,536 INFO L796 eck$LassoCheckResult]: Loop: 377#L20-5 assume !!(f_~x~0 > 0 && f_~y~0 > 0);f_~c~0 := f_#t~nondet3;havoc f_#t~nondet3; 378#L20-3 assume !(0 != f_~c~0 % 256);f_~y~0 := f_~y~0 - f_~d; 377#L20-5 [2019-01-01 22:59:57,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:57,537 INFO L82 PathProgramCache]: Analyzing trace with hash -91683318, now seen corresponding path program 1 times [2019-01-01 22:59:57,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:59:57,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:59:57,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:57,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:59:57,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:57,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:57,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:57,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:57,551 INFO L82 PathProgramCache]: Analyzing trace with hash 3816, now seen corresponding path program 1 times [2019-01-01 22:59:57,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:59:57,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:59:57,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:57,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:59:57,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:57,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:57,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:57,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:57,560 INFO L82 PathProgramCache]: Analyzing trace with hash 2086647473, now seen corresponding path program 1 times [2019-01-01 22:59:57,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:59:57,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:59:57,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:57,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:59:57,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:57,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:57,807 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:59:57,807 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:59:57,807 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:59:57,808 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:59:57,808 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:59:57,808 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:59:57,808 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:59:57,808 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:59:57,809 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_false-unreach-call_true-termination.i_Iteration5_Lasso [2019-01-01 22:59:57,809 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:59:57,809 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:59:57,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:57,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:57,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:57,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:57,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:57,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:57,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:57,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:57,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:57,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:57,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:57,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:58,036 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:59:58,036 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:59:58,040 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:59:58,040 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:59:58,042 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:59:58,043 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:59:58,064 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:59:58,064 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:59:58,070 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:59:58,070 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~1=0} Honda state: {ULTIMATE.start_main_~c~1=-256} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:59:58,091 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:59:58,091 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:59:58,098 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:59:58,099 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet3=-256, ULTIMATE.start_f_~c~0=-256} Honda state: {ULTIMATE.start_f_#t~nondet3=-256, ULTIMATE.start_f_~c~0=-256} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:59:58,121 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:59:58,121 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 22:59:58,172 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:59:58,172 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:59:58,303 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 22:59:58,307 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:59:58,307 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:59:58,307 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:59:58,307 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:59:58,307 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:59:58,308 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:59:58,308 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:59:58,308 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:59:58,308 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_false-unreach-call_true-termination.i_Iteration5_Lasso [2019-01-01 22:59:58,308 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:59:58,308 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:59:58,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:58,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:58,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:58,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:58,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:58,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:58,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:58,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:58,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:58,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:58,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:58,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:58,828 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-01 22:59:58,899 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:59:58,900 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:59:58,900 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:58,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:58,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:58,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:58,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:58,904 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:58,904 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:58,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:58,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:58,905 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:58,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:58,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:58,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:58,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:58,907 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:59:58,908 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:58,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:58,910 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:58,911 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:58,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:58,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:58,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:58,913 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:59:58,913 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:58,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:58,921 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:58,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:58,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:58,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:58,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:58,922 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:58,926 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:58,926 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:58,928 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:58,928 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:58,929 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:58,929 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:58,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:58,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:58,929 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:58,933 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:58,933 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:58,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:58,935 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:58,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:58,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:58,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:58,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:58,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:58,940 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:58,940 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:58,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:58,941 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:58,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:58,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:58,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:58,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:58,947 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:59:58,948 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:58,951 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:58,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:58,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:58,952 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:58,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:58,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:58,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:58,953 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:58,953 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:58,958 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:58,958 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:58,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:58,959 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:59:58,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:58,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:58,959 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:58,963 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:59:58,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:59:58,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:59:58,966 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:59:58,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:59:58,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:59:58,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:59:58,967 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:59:58,971 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:59:58,971 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:59:58,979 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:59:58,983 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 22:59:58,983 INFO L444 ModelExtractionUtils]: 9 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 22:59:58,984 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:59:58,985 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-01 22:59:58,985 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:59:58,985 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~y~0) = 1*ULTIMATE.start_f_~y~0 Supporting invariants [1*ULTIMATE.start_f_~d - 2 >= 0] [2019-01-01 22:59:59,012 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 22:59:59,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:59,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:59:59,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:59:59,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:59:59,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:59:59,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:59:59,258 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-01 22:59:59,258 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 29 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-01-01 22:59:59,303 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 29 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 28 states and 37 transitions. Complement of second has 6 states. [2019-01-01 22:59:59,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 22:59:59,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 22:59:59,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2019-01-01 22:59:59,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-01 22:59:59,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:59:59,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-01 22:59:59,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:59:59,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 7 letters. Loop has 4 letters. [2019-01-01 22:59:59,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:59:59,308 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 37 transitions. [2019-01-01 22:59:59,309 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-01 22:59:59,310 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 27 states and 36 transitions. [2019-01-01 22:59:59,310 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-01-01 22:59:59,310 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-01-01 22:59:59,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2019-01-01 22:59:59,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:59:59,310 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2019-01-01 22:59:59,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2019-01-01 22:59:59,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-01-01 22:59:59,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-01 22:59:59,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2019-01-01 22:59:59,313 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-01-01 22:59:59,313 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-01-01 22:59:59,313 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 22:59:59,313 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2019-01-01 22:59:59,314 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-01 22:59:59,314 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:59:59,314 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:59:59,315 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:59:59,315 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:59:59,315 INFO L794 eck$LassoCheckResult]: Stem: 504#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5, main_~c~1;main_~c~1 := main_#t~nondet5;havoc main_#t~nondet5; 500#L32 assume 0 != main_~c~1 % 256;f_#in~d := 1;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~c~0, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; 501#L12 assume !!(f_~k~0 <= 1073741823); 507#L15-1 assume !!(f_~z~0 < f_~k~0);f_~z~0 := 2 * f_~z~0; 511#L15-1 assume !(f_~z~0 < f_~k~0); 508#L15-2 __VERIFIER_assert_#in~cond := (if f_~z~0 >= 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 509#L3 assume !(0 == __VERIFIER_assert_~cond); 510#L20-2 assume !!(f_~x~0 > 0 && f_~y~0 > 0);f_~c~0 := f_#t~nondet3;havoc f_#t~nondet3; 495#L20 assume 0 != f_~c~0 % 256; 497#L21 [2019-01-01 22:59:59,315 INFO L796 eck$LassoCheckResult]: Loop: 497#L21 f_~x~0 := f_~x~0 - f_~d;f_~y~0 := f_#t~nondet4 % 256;havoc f_#t~nondet4;f_~z~0 := f_~z~0 - 1; 492#L20-2 assume !!(f_~x~0 > 0 && f_~y~0 > 0);f_~c~0 := f_#t~nondet3;havoc f_#t~nondet3; 493#L20 assume 0 != f_~c~0 % 256; 497#L21 [2019-01-01 22:59:59,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:59,316 INFO L82 PathProgramCache]: Analyzing trace with hash 600690221, now seen corresponding path program 1 times [2019-01-01 22:59:59,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:59:59,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:59:59,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:59,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:59:59,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:59,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:59,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:59,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:59,326 INFO L82 PathProgramCache]: Analyzing trace with hash 74319, now seen corresponding path program 1 times [2019-01-01 22:59:59,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:59:59,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:59:59,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:59,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:59:59,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:59,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:59,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:59,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:59:59,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1966304093, now seen corresponding path program 1 times [2019-01-01 22:59:59,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:59:59,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:59:59,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:59,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:59:59,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:59:59,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:59:59,406 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:59:59,407 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:59:59,407 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:59:59,407 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:59:59,407 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:59:59,407 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:59:59,407 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:59:59,408 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:59:59,408 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_false-unreach-call_true-termination.i_Iteration6_Loop [2019-01-01 22:59:59,408 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:59:59,408 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:59:59,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:59,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:59,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:59,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:59:59,718 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:59:59,719 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:59:59,725 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:59:59,725 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:59:59,745 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:59:59,745 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~x~0=1, ULTIMATE.start_f_~d=0} Honda state: {ULTIMATE.start_f_~x~0=1, ULTIMATE.start_f_~d=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:59:59,750 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:59:59,750 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:59:59,764 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:59:59,764 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet4=-1, ULTIMATE.start_f_~y~0=255} Honda state: {ULTIMATE.start_f_#t~nondet4=-1, ULTIMATE.start_f_~y~0=255} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:59:59,786 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:59:59,786 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:59:59,800 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:59:59,800 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet3=-128, ULTIMATE.start_f_~c~0=-128} Honda state: {ULTIMATE.start_f_#t~nondet3=-128, ULTIMATE.start_f_~c~0=-128} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:59:59,827 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:59:59,827 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:59:59,850 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:59:59,850 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:59:59,863 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:59:59,863 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~z~0=0} Honda state: {ULTIMATE.start_f_~z~0=0} Generalized eigenvectors: [{ULTIMATE.start_f_~z~0=0}, {ULTIMATE.start_f_~z~0=-3}, {ULTIMATE.start_f_~z~0=2}] Lambdas: [0, 1, 1] Nus: [0, 0] [2019-01-01 23:00:00,020 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-01-01 23:00:00,090 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:00:00,090 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:00:00,090 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:00:00,091 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:00:00,091 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:00:00,091 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:00,091 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:00:00,091 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:00:00,091 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_false-unreach-call_true-termination.i_Iteration6_Lasso [2019-01-01 23:00:00,091 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:00:00,091 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:00:00,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:00,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:00,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:00,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:00,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:00,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:00,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:00,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:00,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:00,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:00,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:00,393 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 8 [2019-01-01 23:00:00,721 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:00:00,721 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:00,728 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:00,728 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:00,753 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:00:00,753 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:00,768 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:00,769 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~z~0=0, ULTIMATE.start_f_~k~0=0} Honda state: {ULTIMATE.start_f_~z~0=2, ULTIMATE.start_f_~k~0=2} Generalized eigenvectors: [{ULTIMATE.start_f_~z~0=-6, ULTIMATE.start_f_~k~0=-1}, {ULTIMATE.start_f_~z~0=2, ULTIMATE.start_f_~k~0=5}, {ULTIMATE.start_f_~z~0=3, ULTIMATE.start_f_~k~0=-4}] Lambdas: [1, 1, 1] Nus: [0, 0] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:00,790 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:00,790 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:00,799 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:00,799 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet4=0, ULTIMATE.start_f_~y~0=0} Honda state: {ULTIMATE.start_f_#t~nondet4=-128, ULTIMATE.start_f_~y~0=128} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:00,836 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:00,836 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:00,847 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:00,847 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~1=0} Honda state: {ULTIMATE.start_main_~c~1=128} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:00,867 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:00,867 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:00,870 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:00,870 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet0=0} Honda state: {ULTIMATE.start_f_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:00,891 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:00,891 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:00,899 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:00,899 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:00,919 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:00,919 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:00,922 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:00,923 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet2=0} Honda state: {ULTIMATE.start_f_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:00,944 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:00,944 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:00,947 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:00,948 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_#in~cond=0, ULTIMATE.start___VERIFIER_assert_~cond=0} Honda state: {ULTIMATE.start___VERIFIER_assert_#in~cond=1, ULTIMATE.start___VERIFIER_assert_~cond=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:00,969 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:00,969 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:00,972 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:00,973 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet1=0} Honda state: {ULTIMATE.start_f_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:00,995 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:00,995 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:00,999 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:00,999 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=0} Honda state: {ULTIMATE.start_main_#t~nondet5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:01,021 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:01,021 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:01,045 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:00:01,046 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:01,217 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:00:01,218 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:00:01,218 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:00:01,218 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:00:01,219 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:00:01,219 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:00:01,219 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:01,219 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:00:01,219 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:00:01,219 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_false-unreach-call_true-termination.i_Iteration6_Lasso [2019-01-01 23:00:01,219 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:00:01,219 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:00:01,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:01,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:01,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:01,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:01,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:01,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:01,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:01,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:01,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:01,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:01,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:01,543 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:00:01,544 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:00:01,544 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:01,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:01,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:01,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:01,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:01,546 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:01,546 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:01,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:01,553 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:01,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:01,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:01,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:01,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:01,555 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:01,555 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:01,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:01,562 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:01,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:01,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:01,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:01,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:01,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:01,563 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:01,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:01,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:01,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:01,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:01,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:01,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:01,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:01,566 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:01,566 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:01,571 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:01,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:01,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:01,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:01,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:01,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:01,574 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:01,574 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:01,582 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:00:01,591 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-01-01 23:00:01,591 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-01 23:00:01,591 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:00:01,592 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-01 23:00:01,592 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:00:01,592 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~x~0, ULTIMATE.start_f_~d) = 1*ULTIMATE.start_f_~x~0 - 1*ULTIMATE.start_f_~d Supporting invariants [1*ULTIMATE.start_f_~d - 1 >= 0] [2019-01-01 23:00:01,621 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 23:00:01,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:01,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:01,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:01,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:01,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:01,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:00:01,719 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-01 23:00:01,719 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 15 Second operand 5 states. [2019-01-01 23:00:01,767 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 15. Second operand 5 states. Result 36 states and 48 transitions. Complement of second has 7 states. [2019-01-01 23:00:01,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 23:00:01,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 23:00:01,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2019-01-01 23:00:01,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 9 letters. Loop has 3 letters. [2019-01-01 23:00:01,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:01,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 12 letters. Loop has 3 letters. [2019-01-01 23:00:01,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:01,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 9 letters. Loop has 6 letters. [2019-01-01 23:00:01,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:01,772 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 48 transitions. [2019-01-01 23:00:01,773 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-01 23:00:01,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 32 states and 43 transitions. [2019-01-01 23:00:01,774 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-01-01 23:00:01,774 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-01-01 23:00:01,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 43 transitions. [2019-01-01 23:00:01,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:00:01,774 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2019-01-01 23:00:01,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 43 transitions. [2019-01-01 23:00:01,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-01-01 23:00:01,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-01 23:00:01,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2019-01-01 23:00:01,777 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-01-01 23:00:01,777 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-01-01 23:00:01,777 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 23:00:01,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 42 transitions. [2019-01-01 23:00:01,778 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-01 23:00:01,778 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:00:01,778 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:00:01,779 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:00:01,779 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 23:00:01,779 INFO L794 eck$LassoCheckResult]: Stem: 639#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5, main_~c~1;main_~c~1 := main_#t~nondet5;havoc main_#t~nondet5; 640#L32 assume !(0 != main_~c~1 % 256);f_#in~d := 2;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~c~0, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; 642#L12-1 assume !!(f_~k~0 <= 1073741823); 643#L15-4 assume !!(f_~z~0 < f_~k~0);f_~z~0 := 2 * f_~z~0; 644#L15-4 assume !(f_~z~0 < f_~k~0); 635#L15-5 __VERIFIER_assert_#in~cond := (if f_~z~0 >= 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 636#L3-3 assume !(0 == __VERIFIER_assert_~cond); 638#L20-5 assume !!(f_~x~0 > 0 && f_~y~0 > 0);f_~c~0 := f_#t~nondet3;havoc f_#t~nondet3; 623#L20-3 assume 0 != f_~c~0 % 256; 624#L21-1 [2019-01-01 23:00:01,779 INFO L796 eck$LassoCheckResult]: Loop: 624#L21-1 f_~x~0 := f_~x~0 - f_~d;f_~y~0 := f_#t~nondet4 % 256;havoc f_#t~nondet4;f_~z~0 := f_~z~0 - 1; 619#L20-5 assume !!(f_~x~0 > 0 && f_~y~0 > 0);f_~c~0 := f_#t~nondet3;havoc f_#t~nondet3; 620#L20-3 assume 0 != f_~c~0 % 256; 624#L21-1 [2019-01-01 23:00:01,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:01,780 INFO L82 PathProgramCache]: Analyzing trace with hash 2086647469, now seen corresponding path program 1 times [2019-01-01 23:00:01,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:01,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:01,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:01,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:01,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:01,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:01,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:01,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:01,789 INFO L82 PathProgramCache]: Analyzing trace with hash 122976, now seen corresponding path program 1 times [2019-01-01 23:00:01,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:01,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:01,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:01,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:01,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:01,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:01,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:01,795 INFO L82 PathProgramCache]: Analyzing trace with hash -2041800140, now seen corresponding path program 1 times [2019-01-01 23:00:01,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:01,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:01,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:01,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:01,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:01,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:01,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:01,892 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:00:01,892 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:00:01,892 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:00:01,893 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:00:01,893 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:00:01,893 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:01,893 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:00:01,893 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:00:01,893 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_false-unreach-call_true-termination.i_Iteration7_Loop [2019-01-01 23:00:01,894 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:00:01,894 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:00:01,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:01,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:01,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:01,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:02,050 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:00:02,050 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:02,054 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:02,055 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:02,083 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:00:02,084 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:02,096 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:02,096 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~z~0=0} Honda state: {ULTIMATE.start_f_~z~0=0} Generalized eigenvectors: [{ULTIMATE.start_f_~z~0=0}, {ULTIMATE.start_f_~z~0=-3}, {ULTIMATE.start_f_~z~0=2}] Lambdas: [0, 1, 1] Nus: [0, 0] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:02,117 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:02,117 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:02,129 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:02,130 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet3=-128, ULTIMATE.start_f_~c~0=-128} Honda state: {ULTIMATE.start_f_#t~nondet3=-128, ULTIMATE.start_f_~c~0=-128} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:02,151 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:02,151 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:02,173 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:02,173 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~x~0=1, ULTIMATE.start_f_~d=0} Honda state: {ULTIMATE.start_f_~x~0=1, ULTIMATE.start_f_~d=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:02,177 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:02,177 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:02,186 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:02,187 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet4=247, ULTIMATE.start_f_~y~0=247} Honda state: {ULTIMATE.start_f_#t~nondet4=247, ULTIMATE.start_f_~y~0=247} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2019-01-01 23:00:02,348 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:00:02,348 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:00:02,348 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:00:02,348 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:00:02,348 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:00:02,348 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:02,348 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:00:02,348 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:00:02,349 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_false-unreach-call_true-termination.i_Iteration7_Lasso [2019-01-01 23:00:02,349 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:00:02,349 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:00:02,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:02,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:02,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:02,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:02,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:02,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:02,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:02,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:02,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:02,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:02,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:02,631 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:00:02,631 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:02,636 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:02,636 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:02,656 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:02,657 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~c~0=0, ULTIMATE.start_f_#t~nondet3=0} Honda state: {ULTIMATE.start_f_~c~0=-128, ULTIMATE.start_f_#t~nondet3=-128} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:02,684 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:02,684 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:02,687 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:02,687 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start___VERIFIER_assert_#in~cond=0} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:02,708 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:02,708 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:02,715 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:02,715 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~1=0} Honda state: {ULTIMATE.start_main_~c~1=-256} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:02,736 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:02,736 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:02,738 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:02,738 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet2=0} Honda state: {ULTIMATE.start_f_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:02,758 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:02,758 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:02,789 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:00:02,790 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:02,815 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:02,816 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~k~0=0, ULTIMATE.start_f_~z~0=0} Honda state: {ULTIMATE.start_f_~k~0=2, ULTIMATE.start_f_~z~0=2} Generalized eigenvectors: [{ULTIMATE.start_f_~k~0=0, ULTIMATE.start_f_~z~0=-7}, {ULTIMATE.start_f_~k~0=0, ULTIMATE.start_f_~z~0=6}, {ULTIMATE.start_f_~k~0=0, ULTIMATE.start_f_~z~0=0}] Lambdas: [1, 1, 3] Nus: [0, 0] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:02,837 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:02,838 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:02,841 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:02,841 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:02,862 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:02,862 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:02,872 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:02,872 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~y~0=0, ULTIMATE.start_f_#t~nondet4=0} Honda state: {ULTIMATE.start_f_~y~0=255, ULTIMATE.start_f_#t~nondet4=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:02,894 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:02,894 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:02,897 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:02,897 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet0=0} Honda state: {ULTIMATE.start_f_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:02,919 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:02,919 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:02,921 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:02,922 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet1=0} Honda state: {ULTIMATE.start_f_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:02,942 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:02,942 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:02,945 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:02,945 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=0} Honda state: {ULTIMATE.start_main_#t~nondet5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:02,966 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:02,966 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:02,990 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:00:02,990 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:03,160 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:00:03,162 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:00:03,162 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:00:03,162 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:00:03,162 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:00:03,162 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:00:03,163 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:03,163 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:00:03,163 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:00:03,163 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_false-unreach-call_true-termination.i_Iteration7_Lasso [2019-01-01 23:00:03,163 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:00:03,163 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:00:03,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:03,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:03,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:03,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:03,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:03,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:03,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:03,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:03,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:03,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:03,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:03,459 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:00:03,459 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:00:03,460 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:03,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:03,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:03,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:03,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:03,463 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:03,463 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:03,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:03,465 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:03,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:03,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:03,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:03,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:03,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:03,466 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:03,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:03,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:03,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:03,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:03,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:03,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:03,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:03,468 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:03,468 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:03,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:03,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:03,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:03,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:03,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:03,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:03,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:03,472 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:03,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:03,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:03,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:03,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:03,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:03,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:03,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:03,474 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:03,475 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:03,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:03,479 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:03,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:03,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:03,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:03,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:03,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:03,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:03,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:03,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:03,482 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:03,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:03,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:03,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:03,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:03,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:03,483 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:03,483 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:03,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:03,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:03,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:03,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:03,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:03,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:03,486 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:03,486 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:03,492 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:03,492 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:03,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:03,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:03,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:03,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:03,494 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:03,495 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:03,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:03,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:03,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:03,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:03,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:03,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:03,502 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:03,502 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:03,509 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:00:03,513 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 23:00:03,514 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 23:00:03,514 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:00:03,515 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2019-01-01 23:00:03,516 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:00:03,516 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~x~0) = 1*ULTIMATE.start_f_~x~0 + 1 Supporting invariants [1*ULTIMATE.start_f_~x~0 >= 0, 1*ULTIMATE.start_f_~d - 2 >= 0] [2019-01-01 23:00:03,606 INFO L297 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2019-01-01 23:00:03,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:03,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:03,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:03,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:03,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:00:03,707 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-01 23:00:03,708 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 42 transitions. cyclomatic complexity: 18 Second operand 5 states. [2019-01-01 23:00:03,761 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 42 transitions. cyclomatic complexity: 18. Second operand 5 states. Result 41 states and 55 transitions. Complement of second has 7 states. [2019-01-01 23:00:03,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 23:00:03,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 23:00:03,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2019-01-01 23:00:03,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 9 letters. Loop has 3 letters. [2019-01-01 23:00:03,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:03,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 12 letters. Loop has 3 letters. [2019-01-01 23:00:03,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:03,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 9 letters. Loop has 6 letters. [2019-01-01 23:00:03,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:03,769 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 55 transitions. [2019-01-01 23:00:03,770 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-01 23:00:03,770 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 37 states and 50 transitions. [2019-01-01 23:00:03,771 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-01-01 23:00:03,771 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-01-01 23:00:03,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 50 transitions. [2019-01-01 23:00:03,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:00:03,771 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 50 transitions. [2019-01-01 23:00:03,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 50 transitions. [2019-01-01 23:00:03,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-01-01 23:00:03,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-01 23:00:03,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2019-01-01 23:00:03,777 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 49 transitions. [2019-01-01 23:00:03,777 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 49 transitions. [2019-01-01 23:00:03,777 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 23:00:03,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 49 transitions. [2019-01-01 23:00:03,777 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-01 23:00:03,782 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:00:03,782 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:00:03,782 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:00:03,784 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 23:00:03,785 INFO L794 eck$LassoCheckResult]: Stem: 786#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5, main_~c~1;main_~c~1 := main_#t~nondet5;havoc main_#t~nondet5; 787#L32 assume 0 != main_~c~1 % 256;f_#in~d := 1;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~c~0, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; 788#L12 assume !!(f_~k~0 <= 1073741823); 793#L15-1 assume !!(f_~z~0 < f_~k~0);f_~z~0 := 2 * f_~z~0; 796#L15-1 assume !(f_~z~0 < f_~k~0); 794#L15-2 __VERIFIER_assert_#in~cond := (if f_~z~0 >= 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 795#L3 assume !(0 == __VERIFIER_assert_~cond); 772#L20-2 assume !!(f_~x~0 > 0 && f_~y~0 > 0);f_~c~0 := f_#t~nondet3;havoc f_#t~nondet3; 774#L20 assume 0 != f_~c~0 % 256; 784#L21 f_~x~0 := f_~x~0 - f_~d;f_~y~0 := f_#t~nondet4 % 256;havoc f_#t~nondet4;f_~z~0 := f_~z~0 - 1; 775#L20-2 assume !!(f_~x~0 > 0 && f_~y~0 > 0);f_~c~0 := f_#t~nondet3;havoc f_#t~nondet3; 776#L20 assume !(0 != f_~c~0 % 256);f_~y~0 := f_~y~0 - f_~d; 778#L20-2 [2019-01-01 23:00:03,785 INFO L796 eck$LassoCheckResult]: Loop: 778#L20-2 assume !!(f_~x~0 > 0 && f_~y~0 > 0);f_~c~0 := f_#t~nondet3;havoc f_#t~nondet3; 777#L20 assume !(0 != f_~c~0 % 256);f_~y~0 := f_~y~0 - f_~d; 778#L20-2 [2019-01-01 23:00:03,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:03,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1966304089, now seen corresponding path program 1 times [2019-01-01 23:00:03,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:03,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:03,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:03,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:03,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:03,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:03,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:03,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:03,804 INFO L82 PathProgramCache]: Analyzing trace with hash 2248, now seen corresponding path program 3 times [2019-01-01 23:00:03,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:03,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:03,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:03,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:03,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:03,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:03,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:03,814 INFO L82 PathProgramCache]: Analyzing trace with hash 167381998, now seen corresponding path program 2 times [2019-01-01 23:00:03,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:03,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:03,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:03,818 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:00:03,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:03,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:04,044 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-01-01 23:00:04,083 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:00:04,083 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:00:04,083 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:00:04,083 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:00:04,084 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:00:04,084 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:04,084 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:00:04,084 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:00:04,084 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_false-unreach-call_true-termination.i_Iteration8_Lasso [2019-01-01 23:00:04,085 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:00:04,085 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:00:04,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:04,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:04,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:04,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:04,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:04,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:04,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:04,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:04,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:04,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:04,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:04,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:04,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:04,435 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:00:04,436 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:04,441 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:04,441 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:04,469 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:00:04,469 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:04,923 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:00:04,925 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:00:04,925 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:00:04,925 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:00:04,925 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:00:04,925 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:00:04,926 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:04,926 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:00:04,926 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:00:04,926 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_false-unreach-call_true-termination.i_Iteration8_Lasso [2019-01-01 23:00:04,926 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:00:04,926 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:00:04,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:04,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:04,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:04,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:04,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:04,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:04,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:04,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:04,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:04,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:04,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:04,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:04,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:05,250 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:00:05,251 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:00:05,251 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:05,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:05,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:05,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:05,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:05,253 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:05,253 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:05,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:05,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:05,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:05,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:05,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:05,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:05,258 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:05,258 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:05,264 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:00:05,270 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 23:00:05,270 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-01 23:00:05,270 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:00:05,271 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-01 23:00:05,271 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:00:05,271 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~y~0) = 1*ULTIMATE.start_f_~y~0 Supporting invariants [1*ULTIMATE.start_f_~d - 1 >= 0] [2019-01-01 23:00:05,334 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 23:00:05,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:05,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:05,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:05,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:05,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:06,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:00:06,052 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-01 23:00:06,052 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 49 transitions. cyclomatic complexity: 21 Second operand 4 states. [2019-01-01 23:00:06,127 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 49 transitions. cyclomatic complexity: 21. Second operand 4 states. Result 54 states and 71 transitions. Complement of second has 6 states. [2019-01-01 23:00:06,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 23:00:06,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 23:00:06,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2019-01-01 23:00:06,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 12 letters. Loop has 2 letters. [2019-01-01 23:00:06,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:06,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 14 letters. Loop has 2 letters. [2019-01-01 23:00:06,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:06,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 12 letters. Loop has 4 letters. [2019-01-01 23:00:06,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:06,131 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 71 transitions. [2019-01-01 23:00:06,132 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-01 23:00:06,137 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 46 states and 61 transitions. [2019-01-01 23:00:06,138 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-01-01 23:00:06,138 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-01-01 23:00:06,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 61 transitions. [2019-01-01 23:00:06,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:00:06,138 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 61 transitions. [2019-01-01 23:00:06,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 61 transitions. [2019-01-01 23:00:06,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2019-01-01 23:00:06,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-01 23:00:06,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 59 transitions. [2019-01-01 23:00:06,148 INFO L728 BuchiCegarLoop]: Abstraction has 44 states and 59 transitions. [2019-01-01 23:00:06,148 INFO L608 BuchiCegarLoop]: Abstraction has 44 states and 59 transitions. [2019-01-01 23:00:06,148 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-01 23:00:06,148 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 59 transitions. [2019-01-01 23:00:06,149 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-01 23:00:06,149 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:00:06,149 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:00:06,150 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:00:06,150 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 23:00:06,150 INFO L794 eck$LassoCheckResult]: Stem: 953#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5, main_~c~1;main_~c~1 := main_#t~nondet5;havoc main_#t~nondet5; 954#L32 assume !(0 != main_~c~1 % 256);f_#in~d := 2;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~c~0, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; 956#L12-1 assume !!(f_~k~0 <= 1073741823); 958#L15-4 assume !!(f_~z~0 < f_~k~0);f_~z~0 := 2 * f_~z~0; 959#L15-4 assume !(f_~z~0 < f_~k~0); 948#L15-5 __VERIFIER_assert_#in~cond := (if f_~z~0 >= 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 949#L3-3 assume !(0 == __VERIFIER_assert_~cond); 957#L20-5 assume !!(f_~x~0 > 0 && f_~y~0 > 0);f_~c~0 := f_#t~nondet3;havoc f_#t~nondet3; 964#L20-3 assume 0 != f_~c~0 % 256; 945#L21-1 f_~x~0 := f_~x~0 - f_~d;f_~y~0 := f_#t~nondet4 % 256;havoc f_#t~nondet4;f_~z~0 := f_~z~0 - 1; 946#L20-5 assume !!(f_~x~0 > 0 && f_~y~0 > 0);f_~c~0 := f_#t~nondet3;havoc f_#t~nondet3; 968#L20-3 assume !(0 != f_~c~0 % 256);f_~y~0 := f_~y~0 - f_~d; 930#L20-5 [2019-01-01 23:00:06,150 INFO L796 eck$LassoCheckResult]: Loop: 930#L20-5 assume !!(f_~x~0 > 0 && f_~y~0 > 0);f_~c~0 := f_#t~nondet3;havoc f_#t~nondet3; 931#L20-3 assume !(0 != f_~c~0 % 256);f_~y~0 := f_~y~0 - f_~d; 930#L20-5 [2019-01-01 23:00:06,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:06,151 INFO L82 PathProgramCache]: Analyzing trace with hash -2041800136, now seen corresponding path program 1 times [2019-01-01 23:00:06,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:06,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:06,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:06,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:00:06,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:06,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:06,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:06,180 INFO L82 PathProgramCache]: Analyzing trace with hash 3816, now seen corresponding path program 2 times [2019-01-01 23:00:06,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:06,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:06,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:06,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:06,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:06,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:06,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:06,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:06,190 INFO L82 PathProgramCache]: Analyzing trace with hash 630126431, now seen corresponding path program 2 times [2019-01-01 23:00:06,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:06,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:06,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:06,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:00:06,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:06,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:06,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:06,376 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-01-01 23:00:06,406 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:00:06,406 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:00:06,406 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:00:06,406 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:00:06,406 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:00:06,406 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:06,407 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:00:06,407 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:00:06,407 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_false-unreach-call_true-termination.i_Iteration9_Lasso [2019-01-01 23:00:06,407 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:00:06,407 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:00:06,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:06,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:06,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:06,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:06,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:06,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:06,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:06,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:06,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:06,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:06,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:06,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:06,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:06,746 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2019-01-01 23:00:06,978 WARN L181 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2019-01-01 23:00:07,161 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:00:07,161 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:07,165 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:07,166 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:07,177 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:07,177 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~c~0=0, ULTIMATE.start_f_#t~nondet3=0} Honda state: {ULTIMATE.start_f_~c~0=0, ULTIMATE.start_f_#t~nondet3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:07,197 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:07,197 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:07,203 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:07,203 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~1=0} Honda state: {ULTIMATE.start_main_~c~1=-256} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:07,224 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:07,224 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:07,256 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:00:07,256 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:08,621 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:00:08,623 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:00:08,623 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:00:08,623 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:00:08,623 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:00:08,623 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:00:08,623 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:08,623 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:00:08,624 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:00:08,624 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_false-unreach-call_true-termination.i_Iteration9_Lasso [2019-01-01 23:00:08,624 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:00:08,624 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:00:08,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:08,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:08,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:08,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:08,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:08,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:08,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:08,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:08,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:08,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:08,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:08,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:08,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:09,063 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:00:09,063 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:00:09,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:09,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:09,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:09,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:09,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:09,068 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:09,068 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:09,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:09,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:09,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:09,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:09,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:09,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:09,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:09,078 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:09,083 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:09,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:09,084 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:09,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:09,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:09,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:09,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:09,088 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:09,089 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:09,103 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:00:09,124 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 23:00:09,124 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-01 23:00:09,125 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:00:09,128 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-01 23:00:09,128 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:00:09,128 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~y~0) = 1*ULTIMATE.start_f_~y~0 Supporting invariants [1*ULTIMATE.start_f_~d - 2 >= 0] [2019-01-01 23:00:09,156 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 23:00:09,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:09,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:09,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:09,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:09,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:09,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:00:09,233 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-01 23:00:09,234 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 59 transitions. cyclomatic complexity: 25 Second operand 4 states. [2019-01-01 23:00:09,271 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states and 59 transitions. cyclomatic complexity: 25. Second operand 4 states. Result 62 states and 81 transitions. Complement of second has 6 states. [2019-01-01 23:00:09,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 23:00:09,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 23:00:09,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2019-01-01 23:00:09,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 12 letters. Loop has 2 letters. [2019-01-01 23:00:09,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:09,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 14 letters. Loop has 2 letters. [2019-01-01 23:00:09,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:09,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 12 letters. Loop has 4 letters. [2019-01-01 23:00:09,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:09,276 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 81 transitions. [2019-01-01 23:00:09,277 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-01 23:00:09,281 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 54 states and 71 transitions. [2019-01-01 23:00:09,281 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-01-01 23:00:09,281 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-01-01 23:00:09,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 71 transitions. [2019-01-01 23:00:09,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:00:09,281 INFO L705 BuchiCegarLoop]: Abstraction has 54 states and 71 transitions. [2019-01-01 23:00:09,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 71 transitions. [2019-01-01 23:00:09,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2019-01-01 23:00:09,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-01 23:00:09,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 69 transitions. [2019-01-01 23:00:09,286 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 69 transitions. [2019-01-01 23:00:09,289 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 69 transitions. [2019-01-01 23:00:09,289 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-01 23:00:09,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 69 transitions. [2019-01-01 23:00:09,290 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-01 23:00:09,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:00:09,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:00:09,290 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:00:09,290 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 23:00:09,291 INFO L794 eck$LassoCheckResult]: Stem: 1134#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5, main_~c~1;main_~c~1 := main_#t~nondet5;havoc main_#t~nondet5; 1135#L32 assume 0 != main_~c~1 % 256;f_#in~d := 1;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~c~0, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; 1136#L12 assume !!(f_~k~0 <= 1073741823); 1140#L15-1 assume !!(f_~z~0 < f_~k~0);f_~z~0 := 2 * f_~z~0; 1143#L15-1 assume !(f_~z~0 < f_~k~0); 1141#L15-2 __VERIFIER_assert_#in~cond := (if f_~z~0 >= 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1142#L3 assume !(0 == __VERIFIER_assert_~cond); 1119#L20-2 assume !!(f_~x~0 > 0 && f_~y~0 > 0);f_~c~0 := f_#t~nondet3;havoc f_#t~nondet3; 1120#L20 assume !(0 != f_~c~0 % 256);f_~y~0 := f_~y~0 - f_~d; 1159#L20-2 assume !!(f_~x~0 > 0 && f_~y~0 > 0);f_~c~0 := f_#t~nondet3;havoc f_#t~nondet3; 1158#L20 assume 0 != f_~c~0 % 256; 1152#L21 f_~x~0 := f_~x~0 - f_~d;f_~y~0 := f_#t~nondet4 % 256;havoc f_#t~nondet4;f_~z~0 := f_~z~0 - 1; 1150#L20-2 assume !!(f_~x~0 > 0 && f_~y~0 > 0);f_~c~0 := f_#t~nondet3;havoc f_#t~nondet3; 1146#L20 assume !(0 != f_~c~0 % 256);f_~y~0 := f_~y~0 - f_~d; 1148#L20-2 [2019-01-01 23:00:09,291 INFO L796 eck$LassoCheckResult]: Loop: 1148#L20-2 assume !!(f_~x~0 > 0 && f_~y~0 > 0);f_~c~0 := f_#t~nondet3;havoc f_#t~nondet3; 1149#L20 assume !(0 != f_~c~0 % 256);f_~y~0 := f_~y~0 - f_~d; 1148#L20-2 [2019-01-01 23:00:09,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:09,291 INFO L82 PathProgramCache]: Analyzing trace with hash 277368448, now seen corresponding path program 3 times [2019-01-01 23:00:09,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:09,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:09,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:09,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:00:09,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:09,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:09,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:09,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:09,315 INFO L82 PathProgramCache]: Analyzing trace with hash 2248, now seen corresponding path program 4 times [2019-01-01 23:00:09,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:09,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:09,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:09,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:00:09,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:09,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:09,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:09,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:09,325 INFO L82 PathProgramCache]: Analyzing trace with hash 263107463, now seen corresponding path program 4 times [2019-01-01 23:00:09,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:09,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:09,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:09,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:00:09,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:09,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:09,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:09,572 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2019-01-01 23:00:09,611 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:00:09,612 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:00:09,612 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:00:09,612 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:00:09,612 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:00:09,612 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:09,612 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:00:09,613 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:00:09,613 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_false-unreach-call_true-termination.i_Iteration10_Lasso [2019-01-01 23:00:09,613 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:00:09,613 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:00:09,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:09,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:09,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:09,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:09,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:09,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:09,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:09,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:09,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:09,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:09,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:09,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:09,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:09,874 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:00:09,874 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:09,879 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:09,879 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:09,892 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:09,892 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~c~0=0, ULTIMATE.start_f_#t~nondet3=0} Honda state: {ULTIMATE.start_f_~c~0=0, ULTIMATE.start_f_#t~nondet3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:09,913 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:09,914 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:09,917 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:09,917 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet0=0} Honda state: {ULTIMATE.start_f_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:09,940 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:09,940 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:09,960 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:09,960 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~x~0=0} Honda state: {ULTIMATE.start_f_~x~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:09,967 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:09,967 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:09,990 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:00:09,990 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:10,911 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:00:10,914 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:00:10,914 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:00:10,914 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:00:10,914 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:00:10,914 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:00:10,914 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:10,914 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:00:10,914 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:00:10,914 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_false-unreach-call_true-termination.i_Iteration10_Lasso [2019-01-01 23:00:10,914 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:00:10,915 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:00:10,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:10,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:10,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:10,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:10,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:10,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:10,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:10,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:10,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:10,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:10,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:10,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:10,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:11,238 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:00:11,238 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:00:11,239 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:11,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:11,240 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:11,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:11,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:11,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:11,241 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:11,241 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:11,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:11,242 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:11,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:11,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:11,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:11,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:11,245 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:11,245 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:11,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:11,253 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:11,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:11,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:11,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:11,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:11,255 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:11,255 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:11,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:11,257 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:11,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:11,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:11,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:11,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:11,261 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:11,261 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:11,275 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:00:11,285 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:00:11,285 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:00:11,286 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:00:11,286 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-01 23:00:11,286 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:00:11,287 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~y~0) = 1*ULTIMATE.start_f_~y~0 Supporting invariants [1*ULTIMATE.start_f_~d - 1 >= 0] [2019-01-01 23:00:11,312 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 23:00:11,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:11,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:11,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:11,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:11,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:11,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:00:11,585 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-01 23:00:11,585 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 69 transitions. cyclomatic complexity: 29 Second operand 4 states. [2019-01-01 23:00:11,621 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 69 transitions. cyclomatic complexity: 29. Second operand 4 states. Result 60 states and 77 transitions. Complement of second has 6 states. [2019-01-01 23:00:11,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 23:00:11,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 23:00:11,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2019-01-01 23:00:11,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 14 letters. Loop has 2 letters. [2019-01-01 23:00:11,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:11,626 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:00:11,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:11,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:11,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:11,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:11,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:11,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:00:11,696 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-01 23:00:11,696 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 69 transitions. cyclomatic complexity: 29 Second operand 4 states. [2019-01-01 23:00:11,730 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 69 transitions. cyclomatic complexity: 29. Second operand 4 states. Result 60 states and 77 transitions. Complement of second has 6 states. [2019-01-01 23:00:11,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 23:00:11,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 23:00:11,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2019-01-01 23:00:11,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 14 letters. Loop has 2 letters. [2019-01-01 23:00:11,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:11,732 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:00:11,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:11,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:11,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:11,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:11,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:11,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:00:11,803 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-01 23:00:11,803 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 69 transitions. cyclomatic complexity: 29 Second operand 4 states. [2019-01-01 23:00:11,840 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 69 transitions. cyclomatic complexity: 29. Second operand 4 states. Result 63 states and 82 transitions. Complement of second has 5 states. [2019-01-01 23:00:11,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 23:00:11,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 23:00:11,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2019-01-01 23:00:11,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 14 letters. Loop has 2 letters. [2019-01-01 23:00:11,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:11,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 16 letters. Loop has 2 letters. [2019-01-01 23:00:11,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:11,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 14 letters. Loop has 4 letters. [2019-01-01 23:00:11,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:11,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 82 transitions. [2019-01-01 23:00:11,845 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 23:00:11,850 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 27 states and 35 transitions. [2019-01-01 23:00:11,850 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-01 23:00:11,850 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-01 23:00:11,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2019-01-01 23:00:11,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:00:11,851 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-01-01 23:00:11,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2019-01-01 23:00:11,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-01 23:00:11,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-01 23:00:11,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2019-01-01 23:00:11,854 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-01-01 23:00:11,855 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-01-01 23:00:11,855 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-01 23:00:11,855 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 35 transitions. [2019-01-01 23:00:11,855 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 23:00:11,855 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:00:11,855 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:00:11,856 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:00:11,856 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 23:00:11,856 INFO L794 eck$LassoCheckResult]: Stem: 1547#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5, main_~c~1;main_~c~1 := main_#t~nondet5;havoc main_#t~nondet5; 1548#L32 assume !(0 != main_~c~1 % 256);f_#in~d := 2;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~c~0, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; 1549#L12-1 assume !!(f_~k~0 <= 1073741823); 1550#L15-4 assume !!(f_~z~0 < f_~k~0);f_~z~0 := 2 * f_~z~0; 1551#L15-4 assume !(f_~z~0 < f_~k~0); 1545#L15-5 __VERIFIER_assert_#in~cond := (if f_~z~0 >= 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1546#L3-3 assume !(0 == __VERIFIER_assert_~cond); 1540#L20-5 assume !!(f_~x~0 > 0 && f_~y~0 > 0);f_~c~0 := f_#t~nondet3;havoc f_#t~nondet3; 1542#L20-3 assume !(0 != f_~c~0 % 256);f_~y~0 := f_~y~0 - f_~d; 1562#L20-5 assume !!(f_~x~0 > 0 && f_~y~0 > 0);f_~c~0 := f_#t~nondet3;havoc f_#t~nondet3; 1559#L20-3 assume 0 != f_~c~0 % 256; 1560#L21-1 f_~x~0 := f_~x~0 - f_~d;f_~y~0 := f_#t~nondet4 % 256;havoc f_#t~nondet4;f_~z~0 := f_~z~0 - 1; 1565#L20-5 assume !!(f_~x~0 > 0 && f_~y~0 > 0);f_~c~0 := f_#t~nondet3;havoc f_#t~nondet3; 1563#L20-3 assume !(0 != f_~c~0 % 256);f_~y~0 := f_~y~0 - f_~d; 1553#L20-5 [2019-01-01 23:00:11,856 INFO L796 eck$LassoCheckResult]: Loop: 1553#L20-5 assume !!(f_~x~0 > 0 && f_~y~0 > 0);f_~c~0 := f_#t~nondet3;havoc f_#t~nondet3; 1552#L20-3 assume !(0 != f_~c~0 % 256);f_~y~0 := f_~y~0 - f_~d; 1553#L20-5 [2019-01-01 23:00:11,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:11,856 INFO L82 PathProgramCache]: Analyzing trace with hash 740112881, now seen corresponding path program 3 times [2019-01-01 23:00:11,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:11,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:11,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:11,857 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:00:11,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:11,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:11,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:11,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:11,897 INFO L82 PathProgramCache]: Analyzing trace with hash 3816, now seen corresponding path program 3 times [2019-01-01 23:00:11,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:11,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:11,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:11,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:00:11,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:11,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:11,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:11,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:11,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1716089640, now seen corresponding path program 4 times [2019-01-01 23:00:11,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:11,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:11,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:11,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:00:11,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:11,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:11,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:12,064 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-01 23:00:12,175 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-01 23:00:12,321 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-01-01 23:00:12,444 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:00:12,444 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:00:12,444 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:00:12,445 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:00:12,445 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:00:12,445 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:12,445 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:00:12,445 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:00:12,445 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_false-unreach-call_true-termination.i_Iteration11_Lasso [2019-01-01 23:00:12,446 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:00:12,448 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:00:12,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:12,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:12,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:12,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:12,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:12,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:12,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:12,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:12,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:12,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:12,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:12,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:12,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:12,717 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:00:12,717 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:12,722 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:12,722 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:12,725 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:12,725 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~k~0=0} Honda state: {ULTIMATE.start_f_~k~0=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:12,746 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:12,746 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:12,757 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:12,757 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~c~0=0, ULTIMATE.start_f_#t~nondet3=0} Honda state: {ULTIMATE.start_f_~c~0=0, ULTIMATE.start_f_#t~nondet3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:12,777 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:12,778 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:12,784 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:12,784 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~1=0} Honda state: {ULTIMATE.start_main_~c~1=-256} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:12,806 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:12,806 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:12,809 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:12,809 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:12,829 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:12,830 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:12,849 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:12,850 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~x~0=0} Honda state: {ULTIMATE.start_f_~x~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:12,854 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:12,854 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:12,857 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:12,857 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet0=0} Honda state: {ULTIMATE.start_f_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:12,885 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:12,885 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:12,888 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:12,888 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet2=0} Honda state: {ULTIMATE.start_f_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:12,914 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:12,914 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:12,917 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:12,917 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet4=0} Honda state: {ULTIMATE.start_f_#t~nondet4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:12,938 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:12,938 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:12,941 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:12,941 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=0} Honda state: {ULTIMATE.start_main_#t~nondet5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:12,963 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:12,963 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:12,966 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:00:12,966 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start___VERIFIER_assert_#in~cond=0} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:12,988 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:00:12,988 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:13,013 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:00:13,013 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:00:13,789 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:00:13,791 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:00:13,791 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:00:13,791 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:00:13,791 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:00:13,792 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:00:13,792 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:13,792 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:00:13,792 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:00:13,792 INFO L131 ssoRankerPreferences]: Filename of dumped script: trex01_false-unreach-call_true-termination.i_Iteration11_Lasso [2019-01-01 23:00:13,792 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:00:13,792 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:00:13,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:13,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:13,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:13,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:13,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:13,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:13,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:13,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:13,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:13,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:13,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:13,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:13,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:14,209 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:00:14,209 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:00:14,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:14,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:14,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:14,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:14,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:14,215 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:14,215 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:14,217 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:14,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:14,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:14,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:14,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:14,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:14,219 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:14,219 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:14,221 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:14,224 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:14,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:14,225 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:14,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:14,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:14,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:14,225 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:14,226 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:14,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:14,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:14,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:14,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:14,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:14,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:14,228 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:14,228 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:14,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:14,230 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:14,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:14,230 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:14,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:14,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:14,231 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:14,231 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:14,231 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:14,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:14,232 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:14,232 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:14,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:14,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:14,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:14,233 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:14,233 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:14,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:14,238 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:14,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:14,239 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:14,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:14,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:14,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:14,239 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:14,240 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:14,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:14,242 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:14,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:14,242 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:14,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:14,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:14,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:14,243 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:14,243 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:14,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:14,244 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:14,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:14,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:14,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:14,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:14,246 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:14,246 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:14,248 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:14,248 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:14,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:14,248 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:14,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:14,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:14,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:14,251 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:14,251 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:14,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:14,252 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:14,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:14,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:14,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:14,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:14,253 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:14,253 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:14,267 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:00:14,292 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 23:00:14,292 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-01 23:00:14,293 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:00:14,296 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-01 23:00:14,296 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:00:14,297 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~y~0) = 1*ULTIMATE.start_f_~y~0 Supporting invariants [1*ULTIMATE.start_f_~d - 2 >= 0] [2019-01-01 23:00:14,347 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 23:00:14,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:14,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:14,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:14,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:14,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:14,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:00:14,485 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-01 23:00:14,485 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 14 Second operand 4 states. [2019-01-01 23:00:14,515 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 35 states and 43 transitions. Complement of second has 6 states. [2019-01-01 23:00:14,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 23:00:14,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 23:00:14,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-01-01 23:00:14,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 14 letters. Loop has 2 letters. [2019-01-01 23:00:14,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:14,518 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:00:14,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:14,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:14,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:14,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:14,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:00:14,578 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-01 23:00:14,579 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 14 Second operand 4 states. [2019-01-01 23:00:14,613 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 35 states and 43 transitions. Complement of second has 6 states. [2019-01-01 23:00:14,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 23:00:14,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 23:00:14,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-01-01 23:00:14,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 14 letters. Loop has 2 letters. [2019-01-01 23:00:14,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:14,615 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:00:14,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:14,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:14,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:14,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:14,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:14,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:00:14,677 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-01 23:00:14,678 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 14 Second operand 4 states. [2019-01-01 23:00:14,715 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 38 states and 48 transitions. Complement of second has 5 states. [2019-01-01 23:00:14,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 23:00:14,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 23:00:14,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-01-01 23:00:14,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 14 letters. Loop has 2 letters. [2019-01-01 23:00:14,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:14,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 16 letters. Loop has 2 letters. [2019-01-01 23:00:14,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:14,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 14 letters. Loop has 4 letters. [2019-01-01 23:00:14,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:14,719 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 48 transitions. [2019-01-01 23:00:14,720 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:00:14,720 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 0 states and 0 transitions. [2019-01-01 23:00:14,721 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:00:14,721 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:00:14,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:00:14,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:00:14,721 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:00:14,721 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:00:14,721 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:00:14,722 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-01 23:00:14,722 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 23:00:14,722 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:00:14,722 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 23:00:14,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:00:14 BoogieIcfgContainer [2019-01-01 23:00:14,732 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:00:14,733 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:00:14,733 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:00:14,733 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:00:14,733 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:59:27" (3/4) ... [2019-01-01 23:00:14,738 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 23:00:14,738 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:00:14,739 INFO L168 Benchmark]: Toolchain (without parser) took 48270.96 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 342.4 MB). Free memory was 951.4 MB in the beginning and 1.0 GB in the end (delta: -85.1 MB). Peak memory consumption was 257.3 MB. Max. memory is 11.5 GB. [2019-01-01 23:00:14,739 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:00:14,740 INFO L168 Benchmark]: CACSL2BoogieTranslator took 278.78 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:00:14,740 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.33 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:00:14,742 INFO L168 Benchmark]: Boogie Preprocessor took 33.32 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-01 23:00:14,742 INFO L168 Benchmark]: RCFGBuilder took 531.64 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -158.1 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-01-01 23:00:14,743 INFO L168 Benchmark]: BuchiAutomizer took 47379.33 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 223.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.0 MB). Peak memory consumption was 280.3 MB. Max. memory is 11.5 GB. [2019-01-01 23:00:14,743 INFO L168 Benchmark]: Witness Printer took 4.96 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:00:14,752 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 278.78 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.33 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.32 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 531.64 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -158.1 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 47379.33 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 223.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.0 MB). Peak memory consumption was 280.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.96 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (1 trivial, 8 deterministic, 2 nondeterministic). One deterministic module has affine ranking function -1 * z + k and consists of 5 locations. One deterministic module has affine ranking function -1 * z + k and consists of 4 locations. One deterministic module has affine ranking function y and consists of 4 locations. One deterministic module has affine ranking function y and consists of 4 locations. One deterministic module has affine ranking function x + -1 * d and consists of 5 locations. One deterministic module has affine ranking function x + 1 and consists of 5 locations. One deterministic module has affine ranking function y and consists of 4 locations. One deterministic module has affine ranking function y and consists of 4 locations. One nondeterministic module has affine ranking function y and consists of 4 locations. One nondeterministic module has affine ranking function y and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 47.3s and 12 iterations. TraceHistogramMax:3. Analysis of lassos took 43.9s. Construction of modules took 0.3s. Büchi inclusion checks took 2.7s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 20 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 52 states and ocurred in iteration 9. Nontrivial modules had stage [8, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 247 SDtfs, 365 SDslu, 92 SDs, 0 SdLazy, 164 SolverSat, 69 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN1 SILU0 SILI0 SILT0 lasso10 LassoPreprocessingBenchmarks: Lassos: inital55 mio100 ax100 hnf96 lsp39 ukn100 mio100 lsp100 div361 bol100 ite100 ukn100 eq146 hnf43 smp88 dnf100 smp100 tf102 neg98 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 161ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 53 LassoNonterminationAnalysisSatUnbounded: 4 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 2 LassoNonterminationAnalysisTime: 29.3s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...