./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label25_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label25_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/bin-2019/uautomizer --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 ef22932a563d89d9fa5a5b8bcd7f4a5eeb34d0f3 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 06:59:04,525 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 06:59:04,526 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 06:59:04,533 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 06:59:04,533 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 06:59:04,534 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 06:59:04,534 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 06:59:04,535 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 06:59:04,536 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 06:59:04,537 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 06:59:04,538 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 06:59:04,538 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 06:59:04,539 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 06:59:04,539 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 06:59:04,540 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 06:59:04,541 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 06:59:04,541 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 06:59:04,542 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 06:59:04,544 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 06:59:04,545 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 06:59:04,545 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 06:59:04,546 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 06:59:04,548 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 06:59:04,548 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 06:59:04,548 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 06:59:04,549 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 06:59:04,549 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 06:59:04,550 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 06:59:04,551 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 06:59:04,551 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 06:59:04,552 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 06:59:04,552 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 06:59:04,552 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 06:59:04,552 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 06:59:04,553 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 06:59:04,553 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 06:59:04,554 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 06:59:04,564 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 06:59:04,565 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 06:59:04,565 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 06:59:04,565 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 06:59:04,566 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 06:59:04,566 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 06:59:04,566 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 06:59:04,566 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 06:59:04,566 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 06:59:04,566 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 06:59:04,566 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 06:59:04,567 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 06:59:04,567 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 06:59:04,567 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 06:59:04,567 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 06:59:04,567 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 06:59:04,567 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 06:59:04,567 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 06:59:04,568 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 06:59:04,568 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 06:59:04,568 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 06:59:04,568 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 06:59:04,568 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 06:59:04,568 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 06:59:04,568 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 06:59:04,568 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 06:59:04,569 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 06:59:04,569 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 06:59:04,569 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 06:59:04,569 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 06:59:04,570 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 06:59:04,570 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/bin-2019/uautomizer 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 -> ef22932a563d89d9fa5a5b8bcd7f4a5eeb34d0f3 [2018-11-10 06:59:04,591 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 06:59:04,599 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 06:59:04,601 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 06:59:04,601 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 06:59:04,602 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 06:59:04,602 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label25_true-unreach-call_false-termination.c [2018-11-10 06:59:04,638 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/bin-2019/uautomizer/data/dbe4d4dbc/17e3d607f97d4d17ae45875026377370/FLAG4b936b6cb [2018-11-10 06:59:05,098 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 06:59:05,098 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/sv-benchmarks/c/eca-rers2012/Problem02_label25_true-unreach-call_false-termination.c [2018-11-10 06:59:05,107 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/bin-2019/uautomizer/data/dbe4d4dbc/17e3d607f97d4d17ae45875026377370/FLAG4b936b6cb [2018-11-10 06:59:05,121 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/bin-2019/uautomizer/data/dbe4d4dbc/17e3d607f97d4d17ae45875026377370 [2018-11-10 06:59:05,123 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 06:59:05,125 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 06:59:05,125 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 06:59:05,125 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 06:59:05,129 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 06:59:05,129 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:59:05" (1/1) ... [2018-11-10 06:59:05,132 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18da3d15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:59:05, skipping insertion in model container [2018-11-10 06:59:05,132 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:59:05" (1/1) ... [2018-11-10 06:59:05,140 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 06:59:05,176 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 06:59:05,418 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 06:59:05,421 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 06:59:05,484 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 06:59:05,495 INFO L193 MainTranslator]: Completed translation [2018-11-10 06:59:05,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:59:05 WrapperNode [2018-11-10 06:59:05,496 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 06:59:05,496 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 06:59:05,496 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 06:59:05,496 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 06:59:05,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:59:05" (1/1) ... [2018-11-10 06:59:05,563 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:59:05" (1/1) ... [2018-11-10 06:59:05,600 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 06:59:05,600 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 06:59:05,600 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 06:59:05,600 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 06:59:05,606 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:59:05" (1/1) ... [2018-11-10 06:59:05,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:59:05" (1/1) ... [2018-11-10 06:59:05,610 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:59:05" (1/1) ... [2018-11-10 06:59:05,610 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:59:05" (1/1) ... [2018-11-10 06:59:05,623 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:59:05" (1/1) ... [2018-11-10 06:59:05,632 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:59:05" (1/1) ... [2018-11-10 06:59:05,636 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:59:05" (1/1) ... [2018-11-10 06:59:05,641 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 06:59:05,642 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 06:59:05,642 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 06:59:05,642 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 06:59:05,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:59:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/bin-2019/uautomizer/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 [2018-11-10 06:59:05,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 06:59:05,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 06:59:06,489 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 06:59:06,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:59:06 BoogieIcfgContainer [2018-11-10 06:59:06,489 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 06:59:06,490 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 06:59:06,490 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 06:59:06,492 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 06:59:06,492 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 06:59:06,493 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 06:59:05" (1/3) ... [2018-11-10 06:59:06,493 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e6c8dea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 06:59:06, skipping insertion in model container [2018-11-10 06:59:06,493 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 06:59:06,494 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:59:05" (2/3) ... [2018-11-10 06:59:06,494 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e6c8dea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 06:59:06, skipping insertion in model container [2018-11-10 06:59:06,494 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 06:59:06,494 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:59:06" (3/3) ... [2018-11-10 06:59:06,496 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label25_true-unreach-call_false-termination.c [2018-11-10 06:59:06,528 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 06:59:06,529 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 06:59:06,529 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 06:59:06,529 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 06:59:06,529 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 06:59:06,529 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 06:59:06,529 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 06:59:06,529 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 06:59:06,529 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 06:59:06,543 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-10 06:59:06,566 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-10 06:59:06,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:59:06,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:59:06,573 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 06:59:06,573 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 06:59:06,573 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 06:59:06,573 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-10 06:59:06,579 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-10 06:59:06,579 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:59:06,580 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:59:06,580 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 06:59:06,580 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 06:59:06,585 INFO L793 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 167#L606-3true [2018-11-10 06:59:06,585 INFO L795 eck$LassoCheckResult]: Loop: 167#L606-3true assume true; 163#L606-1true assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 65#L611true assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 192#L30true assume ((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 207#L597true main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 167#L606-3true [2018-11-10 06:59:06,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:59:06,589 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 06:59:06,590 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:59:06,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:59:06,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:59:06,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:59:06,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:59:06,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:59:06,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:59:06,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:59:06,655 INFO L82 PathProgramCache]: Analyzing trace with hash 34545679, now seen corresponding path program 1 times [2018-11-10 06:59:06,655 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:59:06,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:59:06,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:59:06,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:59:06,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:59:06,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:59:06,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:59:06,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:59:06,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1805985165, now seen corresponding path program 1 times [2018-11-10 06:59:06,676 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:59:06,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:59:06,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:59:06,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:59:06,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:59:06,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:59:06,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:59:06,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:59:06,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 06:59:06,867 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 06:59:06,868 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 06:59:06,868 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 06:59:06,868 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 06:59:06,869 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 06:59:06,869 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:59:06,869 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 06:59:06,869 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 06:59:06,869 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label25_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-10 06:59:06,869 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 06:59:06,870 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 06:59:06,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:59:06,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:59:06,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:59:06,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:59:06,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:59:06,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:59:06,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:59:06,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:59:07,104 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 06:59:07,104 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/bin-2019/uautomizer/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 [2018-11-10 06:59:07,108 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:59:07,108 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:59:07,139 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:59:07,139 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=8} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/bin-2019/uautomizer/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 [2018-11-10 06:59:07,143 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:59:07,143 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:59:07,153 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:59:07,153 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a25~0=1, ~a28~0=9} Honda state: {~a25~0=1, ~a28~0=9} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/bin-2019/uautomizer/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 [2018-11-10 06:59:07,182 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:59:07,182 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:59:07,209 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:59:07,209 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=1} Honda state: {~a19~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/bin-2019/uautomizer/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 [2018-11-10 06:59:07,218 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:59:07,218 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:59:07,221 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:59:07,221 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Honda state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/bin-2019/uautomizer/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 [2018-11-10 06:59:07,239 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:59:07,239 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:59:07,261 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:59:07,261 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=1} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/bin-2019/uautomizer/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 [2018-11-10 06:59:07,269 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:59:07,269 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:59:07,272 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:59:07,272 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/bin-2019/uautomizer/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 [2018-11-10 06:59:07,299 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:59:07,300 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:59:07,313 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:59:07,313 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~input~0=4, ULTIMATE.start_main_#t~nondet2=4, ULTIMATE.start_calculate_output_~input=4, ULTIMATE.start_calculate_output_#in~input=4} Honda state: {ULTIMATE.start_main_~input~0=4, ULTIMATE.start_main_#t~nondet2=4, ULTIMATE.start_calculate_output_~input=4, ULTIMATE.start_calculate_output_#in~input=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/bin-2019/uautomizer/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 [2018-11-10 06:59:07,341 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:59:07,341 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/bin-2019/uautomizer/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 [2018-11-10 06:59:07,377 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 06:59:07,377 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:59:07,408 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 06:59:07,409 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 06:59:07,409 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 06:59:07,409 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 06:59:07,410 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 06:59:07,410 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 06:59:07,410 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:59:07,410 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 06:59:07,410 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 06:59:07,410 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label25_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-10 06:59:07,410 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 06:59:07,410 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 06:59:07,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:59:07,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:59:07,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:59:07,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:59:07,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:59:07,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:59:07,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:59:07,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:59:07,639 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 06:59:07,642 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 06:59:07,643 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 [2018-11-10 06:59:07,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:07,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:07,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:07,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:07,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:07,647 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:59:07,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:07,655 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:07,656 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 [2018-11-10 06:59:07,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:07,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:07,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:07,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:07,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:07,658 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:59:07,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:07,660 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:07,661 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 [2018-11-10 06:59:07,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:07,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:07,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:07,662 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 06:59:07,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:07,663 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:59:07,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:07,682 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:07,682 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 [2018-11-10 06:59:07,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:07,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:07,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:07,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:07,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:07,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:59:07,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:07,689 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:07,689 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 [2018-11-10 06:59:07,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:07,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:07,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:07,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:07,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:07,690 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:59:07,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:07,692 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:07,692 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 [2018-11-10 06:59:07,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:07,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:07,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:07,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:07,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:07,695 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:59:07,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:07,696 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:07,697 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 [2018-11-10 06:59:07,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:07,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:07,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:07,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:07,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:07,698 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:59:07,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:07,700 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:07,701 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 [2018-11-10 06:59:07,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:07,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:07,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:07,702 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:59:07,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:07,702 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:59:07,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:07,708 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:07,708 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 06:59:07,708 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 [2018-11-10 06:59:07,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:07,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:07,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:07,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:07,710 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:59:07,710 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:59:07,711 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:07,719 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:07,719 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 [2018-11-10 06:59:07,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:07,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:07,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:07,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:07,720 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:59:07,721 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:59:07,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:07,723 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:07,723 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 [2018-11-10 06:59:07,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:07,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:07,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:07,724 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 06:59:07,724 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:59:07,727 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 06:59:07,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:07,762 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:07,763 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 [2018-11-10 06:59:07,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:07,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:07,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:07,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:07,763 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:59:07,768 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:59:07,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:07,770 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:07,770 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 [2018-11-10 06:59:07,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:07,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:07,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:07,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:07,771 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:59:07,772 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:59:07,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:07,777 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:07,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 [2018-11-10 06:59:07,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:07,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:07,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:07,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:07,778 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:59:07,779 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:59:07,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:07,782 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:07,783 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 [2018-11-10 06:59:07,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:07,783 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:07,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:07,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:07,784 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:59:07,784 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:59:07,784 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:07,785 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:07,785 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 [2018-11-10 06:59:07,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:07,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:07,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:07,786 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:59:07,786 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:59:07,787 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:59:07,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:07,791 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:07,791 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 06:59:07,791 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 [2018-11-10 06:59:07,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:07,792 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:07,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:07,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:07,792 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:59:07,793 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:59:07,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:07,801 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:07,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 [2018-11-10 06:59:07,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:07,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:07,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:07,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:07,803 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:59:07,803 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:59:07,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:07,805 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:07,805 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 [2018-11-10 06:59:07,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:07,806 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:07,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:07,806 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 06:59:07,806 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:59:07,808 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 06:59:07,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:07,818 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:07,818 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 [2018-11-10 06:59:07,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:07,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:07,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:07,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:07,819 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:59:07,819 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:59:07,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:07,823 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:07,823 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 [2018-11-10 06:59:07,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:07,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:07,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:07,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:07,824 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:59:07,824 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:59:07,825 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:07,826 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:07,826 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 [2018-11-10 06:59:07,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:07,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:07,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:07,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:07,827 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:59:07,828 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:59:07,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:07,829 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:07,829 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 [2018-11-10 06:59:07,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:07,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:07,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:07,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:07,830 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:59:07,830 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:59:07,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:07,832 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:07,832 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 [2018-11-10 06:59:07,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:07,833 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:07,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:07,833 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:59:07,833 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:59:07,834 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:59:07,834 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:07,837 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:07,837 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 06:59:07,837 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 [2018-11-10 06:59:07,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:07,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:07,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:07,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:07,838 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:59:07,839 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:59:07,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:07,843 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:07,844 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 [2018-11-10 06:59:07,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:07,845 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:07,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:07,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:07,846 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:59:07,846 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:59:07,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:07,847 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:07,848 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 [2018-11-10 06:59:07,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:07,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:07,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:07,848 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 06:59:07,849 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:59:07,851 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-10 06:59:07,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:07,862 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:07,862 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 [2018-11-10 06:59:07,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:07,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:07,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:07,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:07,863 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:59:07,864 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:59:07,864 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:07,867 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:07,867 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 [2018-11-10 06:59:07,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:07,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:07,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:07,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:07,868 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:59:07,869 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:59:07,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:07,870 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:07,870 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 [2018-11-10 06:59:07,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:07,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:07,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:07,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:07,872 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:59:07,873 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:59:07,873 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:07,874 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:07,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 [2018-11-10 06:59:07,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:07,875 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:07,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:07,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:07,875 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:59:07,878 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:59:07,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:07,879 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:07,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 [2018-11-10 06:59:07,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:07,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:07,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:07,880 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:59:07,880 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:59:07,880 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 06:59:07,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:07,886 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:07,886 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 06:59:07,887 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 [2018-11-10 06:59:07,887 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:07,887 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:59:07,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:07,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:07,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:07,888 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:59:07,889 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:59:07,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:07,898 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:07,899 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 [2018-11-10 06:59:07,899 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:07,899 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:59:07,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:07,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:07,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:07,899 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:59:07,900 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:59:07,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:07,903 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:07,904 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 [2018-11-10 06:59:07,904 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:07,904 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:59:07,904 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:07,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:07,904 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 06:59:07,905 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:59:07,906 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 06:59:07,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:07,928 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:07,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 [2018-11-10 06:59:07,929 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:07,929 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:59:07,929 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:07,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:07,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:07,929 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:59:07,930 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:59:07,930 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:07,933 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:07,934 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 [2018-11-10 06:59:07,934 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:07,934 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:59:07,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:07,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:07,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:07,934 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:59:07,935 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:59:07,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:07,940 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:07,940 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 [2018-11-10 06:59:07,941 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:07,941 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:59:07,941 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:07,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:07,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:07,941 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:59:07,941 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:59:07,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:07,943 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:07,944 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 [2018-11-10 06:59:07,944 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:07,944 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:59:07,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:07,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:07,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:07,945 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:59:07,945 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:59:07,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:07,945 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:07,945 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 [2018-11-10 06:59:07,946 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:07,946 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:59:07,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:07,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:07,946 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:59:07,946 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:59:07,947 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:59:07,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:07,954 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:07,955 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 06:59:07,955 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 [2018-11-10 06:59:07,955 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:07,955 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 06:59:07,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:07,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:07,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:07,956 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:59:07,957 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:59:07,957 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:07,967 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:07,967 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 [2018-11-10 06:59:07,968 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:07,968 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 06:59:07,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:07,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:07,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:07,968 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:59:07,969 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:59:07,969 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:07,972 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:07,972 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 [2018-11-10 06:59:07,972 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:07,973 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 06:59:07,973 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:07,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:07,973 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 06:59:07,973 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:59:07,975 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 06:59:07,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:08,003 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:08,003 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 [2018-11-10 06:59:08,004 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:08,004 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 06:59:08,004 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:08,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:08,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:08,004 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:59:08,005 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:59:08,005 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:08,008 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:08,010 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 [2018-11-10 06:59:08,011 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:08,011 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 06:59:08,011 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:08,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:08,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:08,011 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:59:08,012 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:59:08,012 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:08,014 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:08,015 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 [2018-11-10 06:59:08,015 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:08,015 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 06:59:08,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:08,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:08,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:08,015 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:59:08,016 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:59:08,016 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:08,019 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:08,019 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 [2018-11-10 06:59:08,019 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:08,019 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 06:59:08,020 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:08,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:08,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:08,020 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:59:08,020 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:59:08,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:08,021 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:08,022 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 [2018-11-10 06:59:08,022 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:08,022 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 06:59:08,022 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:08,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:08,023 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:59:08,023 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:59:08,024 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:59:08,024 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:08,030 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:08,030 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 06:59:08,030 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 [2018-11-10 06:59:08,031 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:08,031 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:59:08,031 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:08,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:08,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:08,031 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:59:08,033 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:59:08,034 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:08,041 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:08,041 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 [2018-11-10 06:59:08,042 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:08,042 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:59:08,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:08,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:08,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:08,043 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:59:08,043 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:59:08,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:08,047 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:08,047 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 [2018-11-10 06:59:08,048 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:08,048 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:59:08,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:08,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:08,048 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 06:59:08,048 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:59:08,052 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-10 06:59:08,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:08,081 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:08,082 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 [2018-11-10 06:59:08,082 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:08,082 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:59:08,082 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:08,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:08,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:08,083 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:59:08,084 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:59:08,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:08,090 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:08,090 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 [2018-11-10 06:59:08,091 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:08,091 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:59:08,091 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:08,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:08,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:08,091 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:59:08,092 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:59:08,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:08,096 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:08,096 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 [2018-11-10 06:59:08,097 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:08,097 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:59:08,097 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:08,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:08,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:08,097 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:59:08,098 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:59:08,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:08,101 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:08,101 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 [2018-11-10 06:59:08,102 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:08,102 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:59:08,102 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:08,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:08,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:08,102 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:59:08,103 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:59:08,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:08,104 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:08,104 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 [2018-11-10 06:59:08,104 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:08,105 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:59:08,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:08,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:08,105 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:59:08,105 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:59:08,107 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 06:59:08,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:08,115 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:08,115 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 06:59:08,115 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 [2018-11-10 06:59:08,116 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:08,116 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:59:08,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:08,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:08,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:08,116 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:59:08,117 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:59:08,117 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:08,125 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:08,126 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 [2018-11-10 06:59:08,126 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:08,126 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:59:08,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:08,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:08,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:08,126 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:59:08,127 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:59:08,127 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:08,129 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:08,129 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 [2018-11-10 06:59:08,129 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:08,130 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:59:08,130 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:08,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:08,130 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 06:59:08,130 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:59:08,131 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 06:59:08,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:08,146 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:08,146 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 [2018-11-10 06:59:08,146 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:08,147 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:59:08,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:08,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:08,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:08,147 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:59:08,147 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:59:08,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:08,151 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:08,152 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 [2018-11-10 06:59:08,152 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:08,152 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:59:08,152 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:08,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:08,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:08,152 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:59:08,153 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:59:08,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:08,154 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:08,155 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 [2018-11-10 06:59:08,155 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:08,155 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:59:08,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:08,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:08,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:08,155 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:59:08,156 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:59:08,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:08,157 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:08,158 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 [2018-11-10 06:59:08,158 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:08,158 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:59:08,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:08,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:08,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:08,159 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:59:08,159 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:59:08,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:08,160 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:08,161 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 [2018-11-10 06:59:08,161 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:08,161 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:59:08,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:08,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:08,161 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:59:08,162 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:59:08,162 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:59:08,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:08,168 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:08,168 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 06:59:08,169 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 [2018-11-10 06:59:08,169 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:08,169 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:59:08,169 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:08,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:08,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:08,170 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 06:59:08,171 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:59:08,171 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:08,198 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:08,199 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 [2018-11-10 06:59:08,199 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:08,199 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:59:08,199 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:08,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:08,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:08,200 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 06:59:08,200 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:59:08,200 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:08,203 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:08,203 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 [2018-11-10 06:59:08,204 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:08,204 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:59:08,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:08,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:08,206 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 06:59:08,206 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 06:59:08,208 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-10 06:59:08,208 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:08,270 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:08,270 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 [2018-11-10 06:59:08,271 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:08,271 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:59:08,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:08,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:08,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:08,271 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 06:59:08,275 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:59:08,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:08,282 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:08,283 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 [2018-11-10 06:59:08,283 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:08,283 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:59:08,283 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:08,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:08,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:08,284 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 06:59:08,284 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:59:08,284 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:08,286 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:08,287 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 [2018-11-10 06:59:08,287 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:08,287 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:59:08,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:08,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:08,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:08,288 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 06:59:08,288 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:59:08,288 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:08,290 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:08,291 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 [2018-11-10 06:59:08,291 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:08,291 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:59:08,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:08,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:08,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:08,292 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 06:59:08,292 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:59:08,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:08,294 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:08,294 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 [2018-11-10 06:59:08,295 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:08,295 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:59:08,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:08,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:08,295 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:59:08,295 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 06:59:08,296 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 06:59:08,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:08,303 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:08,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:59:08,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:59:08,313 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 3 states. [2018-11-10 06:59:08,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:59:08,824 INFO L93 Difference]: Finished difference Result 381 states and 548 transitions. [2018-11-10 06:59:08,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:59:08,825 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 381 states and 548 transitions. [2018-11-10 06:59:08,830 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 372 [2018-11-10 06:59:08,835 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 381 states to 374 states and 541 transitions. [2018-11-10 06:59:08,836 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 374 [2018-11-10 06:59:08,837 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 374 [2018-11-10 06:59:08,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 374 states and 541 transitions. [2018-11-10 06:59:08,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 06:59:08,839 INFO L705 BuchiCegarLoop]: Abstraction has 374 states and 541 transitions. [2018-11-10 06:59:08,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states and 541 transitions. [2018-11-10 06:59:08,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2018-11-10 06:59:08,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-11-10 06:59:08,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 539 transitions. [2018-11-10 06:59:08,865 INFO L728 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-10 06:59:08,865 INFO L608 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-10 06:59:08,865 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 06:59:08,865 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 373 states and 539 transitions. [2018-11-10 06:59:08,867 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 371 [2018-11-10 06:59:08,867 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:59:08,867 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:59:08,867 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 06:59:08,867 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:59:08,868 INFO L793 eck$LassoCheckResult]: Stem: 751#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 632#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 633#L606-3 [2018-11-10 06:59:08,868 INFO L795 eck$LassoCheckResult]: Loop: 633#L606-3 assume true; 974#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 972#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 970#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 968#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 966#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 964#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 962#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 960#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 959#L54 assume (((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1);~a28~0 := 7;~a11~0 := 1;~a25~0 := 0;calculate_output_#res := -1; 635#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 633#L606-3 [2018-11-10 06:59:08,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:59:08,868 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-10 06:59:08,868 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:59:08,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:59:08,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:59:08,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:59:08,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:59:08,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:59:08,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:59:08,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:59:08,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1956321088, now seen corresponding path program 1 times [2018-11-10 06:59:08,873 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:59:08,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:59:08,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:59:08,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:59:08,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:59:08,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:59:08,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:59:08,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:59:08,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1962170302, now seen corresponding path program 1 times [2018-11-10 06:59:08,885 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:59:08,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:59:08,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:59:08,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:59:08,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:59:08,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:59:08,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:59:08,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:59:08,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 06:59:08,989 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 06:59:08,989 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 06:59:08,989 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 06:59:08,989 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 06:59:08,989 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 06:59:08,989 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:59:08,989 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 06:59:08,989 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 06:59:08,989 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label25_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-10 06:59:08,989 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 06:59:08,990 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 06:59:08,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:59:08,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:59:08,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:59:09,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:59:09,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:59:09,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:59:09,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:59:09,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:59:09,112 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 06:59:09,112 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/bin-2019/uautomizer/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 [2018-11-10 06:59:09,117 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:59:09,117 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:59:09,145 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:59:09,145 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=8} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/bin-2019/uautomizer/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 [2018-11-10 06:59:09,156 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:59:09,156 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:59:09,161 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:59:09,161 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Honda state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/bin-2019/uautomizer/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 [2018-11-10 06:59:09,178 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:59:09,178 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:59:09,181 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:59:09,181 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=-2} Honda state: {~a19~0=-2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/bin-2019/uautomizer/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 [2018-11-10 06:59:09,199 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:59:09,199 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:59:09,216 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:59:09,217 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/bin-2019/uautomizer/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 [2018-11-10 06:59:09,234 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:59:09,234 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:59:09,260 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:59:09,261 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=1} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/bin-2019/uautomizer/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 [2018-11-10 06:59:09,271 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:59:09,271 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/bin-2019/uautomizer/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 [2018-11-10 06:59:09,290 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 06:59:09,291 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:59:09,321 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 06:59:09,322 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 06:59:09,323 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 06:59:09,323 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 06:59:09,323 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 06:59:09,323 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 06:59:09,323 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:59:09,323 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 06:59:09,323 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 06:59:09,323 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label25_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-10 06:59:09,323 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 06:59:09,323 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 06:59:09,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:59:09,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:59:09,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:59:09,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:59:09,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:59:09,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:59:09,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:59:09,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:59:09,532 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 06:59:09,532 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 06:59:09,532 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 [2018-11-10 06:59:09,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:09,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:09,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:09,534 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:59:09,534 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,535 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,535 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 [2018-11-10 06:59:09,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:09,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:09,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:09,539 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:59:09,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,540 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,540 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 [2018-11-10 06:59:09,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:09,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,541 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:59:09,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:09,541 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:59:09,541 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,542 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,542 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 [2018-11-10 06:59:09,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:09,542 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:09,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:09,543 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:59:09,543 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,543 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,543 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 [2018-11-10 06:59:09,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:09,544 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:09,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:09,544 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:59:09,545 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,545 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,545 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 [2018-11-10 06:59:09,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:09,546 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,546 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:59:09,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:09,546 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:59:09,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,547 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,548 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 [2018-11-10 06:59:09,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:09,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,548 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:59:09,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:09,550 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:59:09,550 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,551 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,552 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 [2018-11-10 06:59:09,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:09,552 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:09,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:09,553 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:59:09,553 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,554 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,554 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 06:59:09,554 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 [2018-11-10 06:59:09,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:09,554 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:09,555 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:59:09,555 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:59:09,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,556 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,556 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 [2018-11-10 06:59:09,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:09,557 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:09,557 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:59:09,557 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:59:09,557 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,558 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,558 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 [2018-11-10 06:59:09,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:09,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,559 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:59:09,559 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:59:09,559 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:59:09,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,560 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,560 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 [2018-11-10 06:59:09,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:09,567 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:09,567 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:59:09,567 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:59:09,567 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,568 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,568 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 [2018-11-10 06:59:09,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:09,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:09,568 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:59:09,569 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:59:09,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,569 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,570 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 [2018-11-10 06:59:09,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:09,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,570 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:59:09,570 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:59:09,571 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:59:09,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,572 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,574 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 [2018-11-10 06:59:09,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:09,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,575 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:59:09,575 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:59:09,575 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:59:09,575 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,578 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,578 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 [2018-11-10 06:59:09,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:09,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:09,579 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:59:09,579 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:59:09,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,581 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,582 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 06:59:09,582 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 [2018-11-10 06:59:09,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:09,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:09,583 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:59:09,583 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:59:09,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,584 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,584 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 [2018-11-10 06:59:09,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:09,585 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:09,585 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:59:09,586 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:59:09,586 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,587 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,588 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 [2018-11-10 06:59:09,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:09,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,589 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:59:09,589 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:59:09,589 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:59:09,589 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,590 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,590 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 [2018-11-10 06:59:09,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:09,590 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:09,591 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:59:09,591 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:59:09,591 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,591 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,591 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 [2018-11-10 06:59:09,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:09,592 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:09,593 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:59:09,594 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:59:09,594 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,595 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,595 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 [2018-11-10 06:59:09,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:09,595 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,596 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:59:09,596 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:59:09,596 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:59:09,596 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,598 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,598 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 [2018-11-10 06:59:09,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:09,599 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,599 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:59:09,599 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:59:09,600 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:59:09,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,607 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,607 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 [2018-11-10 06:59:09,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:09,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:09,608 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:59:09,609 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:59:09,609 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,611 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,611 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 06:59:09,611 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 [2018-11-10 06:59:09,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:09,612 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:09,612 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:59:09,613 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:59:09,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,615 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,615 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 [2018-11-10 06:59:09,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:09,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:09,616 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:59:09,616 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:59:09,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,618 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,618 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 [2018-11-10 06:59:09,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:09,619 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,619 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:59:09,619 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:59:09,619 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 06:59:09,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,620 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,620 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 [2018-11-10 06:59:09,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:09,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:09,621 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:59:09,621 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:59:09,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,622 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,622 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 [2018-11-10 06:59:09,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:09,623 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:09,623 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:59:09,623 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:59:09,623 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,626 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,626 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 [2018-11-10 06:59:09,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:09,627 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,627 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:59:09,627 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:59:09,628 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 06:59:09,628 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,630 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,630 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 [2018-11-10 06:59:09,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:09,631 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,631 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:59:09,631 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:59:09,632 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 06:59:09,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,644 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,644 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 [2018-11-10 06:59:09,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:09,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:09,645 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:59:09,645 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:59:09,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,649 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,649 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 06:59:09,649 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 [2018-11-10 06:59:09,650 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:09,650 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:59:09,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:09,650 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:59:09,651 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:59:09,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,653 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,653 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 [2018-11-10 06:59:09,654 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:09,654 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:59:09,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:09,654 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:59:09,655 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:59:09,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,658 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,659 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 [2018-11-10 06:59:09,659 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:09,659 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:59:09,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,660 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:59:09,660 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:59:09,660 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:59:09,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,661 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,661 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 [2018-11-10 06:59:09,661 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:09,661 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:59:09,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:09,662 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:59:09,662 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:59:09,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,663 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,663 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 [2018-11-10 06:59:09,663 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:09,663 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:59:09,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:09,664 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:59:09,665 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:59:09,665 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,667 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,667 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 [2018-11-10 06:59:09,667 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:09,667 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:59:09,667 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,668 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:59:09,668 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:59:09,669 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:59:09,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,672 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,673 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 [2018-11-10 06:59:09,673 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:09,673 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:59:09,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,673 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:59:09,673 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:59:09,674 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:59:09,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,680 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,681 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 [2018-11-10 06:59:09,681 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:09,681 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:59:09,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:09,681 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:59:09,682 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:59:09,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,685 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,686 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 06:59:09,686 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 [2018-11-10 06:59:09,686 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:09,686 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 06:59:09,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:09,687 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:59:09,687 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:59:09,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,690 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,690 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 [2018-11-10 06:59:09,691 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:09,691 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 06:59:09,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:09,691 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:59:09,692 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:59:09,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,696 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,696 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 [2018-11-10 06:59:09,696 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:09,696 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 06:59:09,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,697 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:59:09,697 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:59:09,698 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:59:09,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,699 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,699 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 [2018-11-10 06:59:09,699 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:09,699 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 06:59:09,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:09,700 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:59:09,700 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:59:09,700 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,701 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,701 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 [2018-11-10 06:59:09,702 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:09,702 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 06:59:09,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:09,702 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:59:09,703 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:59:09,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,705 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,706 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 [2018-11-10 06:59:09,706 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:09,706 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 06:59:09,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,707 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:59:09,707 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:59:09,708 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:59:09,708 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,713 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,714 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 [2018-11-10 06:59:09,714 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:09,714 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 06:59:09,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,714 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:59:09,714 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:59:09,717 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:59:09,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,729 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,729 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 [2018-11-10 06:59:09,729 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:09,730 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 06:59:09,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:09,730 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:59:09,731 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:59:09,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,739 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,740 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 06:59:09,740 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 [2018-11-10 06:59:09,740 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:09,740 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:59:09,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:09,741 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:59:09,742 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:59:09,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,745 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,745 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 [2018-11-10 06:59:09,745 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:09,745 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:59:09,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:09,746 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:59:09,747 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:59:09,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,752 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,758 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 [2018-11-10 06:59:09,759 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:09,759 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:59:09,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,759 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:59:09,759 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:59:09,760 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 06:59:09,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,761 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,761 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 [2018-11-10 06:59:09,762 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:09,762 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:59:09,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:09,762 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:59:09,763 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:59:09,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,764 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,768 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 [2018-11-10 06:59:09,768 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:09,768 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:59:09,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:09,769 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:59:09,770 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:59:09,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,775 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,775 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 [2018-11-10 06:59:09,776 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:09,776 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:59:09,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,776 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:59:09,776 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:59:09,778 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 06:59:09,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,786 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,786 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 [2018-11-10 06:59:09,787 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:09,787 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:59:09,787 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,787 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:59:09,787 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:59:09,790 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 06:59:09,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,811 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,812 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 [2018-11-10 06:59:09,812 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:09,812 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:59:09,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:09,813 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:59:09,815 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:59:09,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,824 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,824 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 06:59:09,824 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 [2018-11-10 06:59:09,825 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:09,825 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:59:09,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:09,825 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:59:09,826 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:59:09,826 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,827 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,827 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 [2018-11-10 06:59:09,827 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:09,828 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:59:09,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:09,828 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:59:09,828 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:59:09,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,831 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,832 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 [2018-11-10 06:59:09,832 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:09,832 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:59:09,832 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,832 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:59:09,832 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:59:09,833 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:59:09,833 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,834 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,834 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 [2018-11-10 06:59:09,835 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:09,835 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:59:09,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:09,835 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:59:09,835 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:59:09,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,836 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,837 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 [2018-11-10 06:59:09,837 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:09,837 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:59:09,837 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:09,838 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:59:09,838 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:59:09,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,839 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,839 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 [2018-11-10 06:59:09,840 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:09,840 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:59:09,840 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,840 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:59:09,840 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:59:09,841 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:59:09,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,845 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,845 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 [2018-11-10 06:59:09,845 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:09,845 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:59:09,845 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,846 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:59:09,846 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:59:09,847 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:59:09,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,853 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,853 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 [2018-11-10 06:59:09,853 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:09,853 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:59:09,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:09,854 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:59:09,854 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:59:09,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,859 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,859 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 06:59:09,860 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 [2018-11-10 06:59:09,860 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:09,860 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:59:09,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:09,860 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 06:59:09,861 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:59:09,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,863 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,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 [2018-11-10 06:59:09,863 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:09,863 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:59:09,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:09,864 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 06:59:09,864 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:59:09,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,870 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,870 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 [2018-11-10 06:59:09,870 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:09,870 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:59:09,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,871 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:59:09,871 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 06:59:09,871 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 06:59:09,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,873 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,873 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 [2018-11-10 06:59:09,874 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:09,874 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:59:09,874 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:09,874 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 06:59:09,874 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:59:09,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,876 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,877 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 [2018-11-10 06:59:09,877 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:09,877 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:59:09,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:09,877 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 06:59:09,878 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:59:09,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,880 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,880 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 [2018-11-10 06:59:09,880 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:09,880 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:59:09,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,880 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:59:09,881 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 06:59:09,882 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 06:59:09,882 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,888 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,888 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 [2018-11-10 06:59:09,889 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:09,889 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:59:09,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,889 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:59:09,889 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 06:59:09,891 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 06:59:09,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,909 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,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 [2018-11-10 06:59:09,910 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:59:09,910 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:59:09,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:09,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:09,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:09,910 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 06:59:09,912 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:59:09,912 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:09,929 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:09,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:59:09,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:59:09,930 INFO L87 Difference]: Start difference. First operand 373 states and 539 transitions. cyclomatic complexity: 167 Second operand 3 states. [2018-11-10 06:59:10,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:59:10,385 INFO L93 Difference]: Finished difference Result 660 states and 918 transitions. [2018-11-10 06:59:10,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:59:10,387 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 660 states and 918 transitions. [2018-11-10 06:59:10,391 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-10 06:59:10,395 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 660 states to 660 states and 918 transitions. [2018-11-10 06:59:10,395 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 660 [2018-11-10 06:59:10,396 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 660 [2018-11-10 06:59:10,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 660 states and 918 transitions. [2018-11-10 06:59:10,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 06:59:10,399 INFO L705 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-11-10 06:59:10,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states and 918 transitions. [2018-11-10 06:59:10,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2018-11-10 06:59:10,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2018-11-10 06:59:10,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 918 transitions. [2018-11-10 06:59:10,418 INFO L728 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-11-10 06:59:10,418 INFO L608 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-11-10 06:59:10,418 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 06:59:10,418 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 660 states and 918 transitions. [2018-11-10 06:59:10,423 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-10 06:59:10,423 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:59:10,423 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:59:10,426 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 06:59:10,426 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:59:10,426 INFO L793 eck$LassoCheckResult]: Stem: 1796#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 1673#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 1674#L606-3 [2018-11-10 06:59:10,427 INFO L795 eck$LassoCheckResult]: Loop: 1674#L606-3 assume true; 1902#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1774#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 1775#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 1920#L35 assume ~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1);~a28~0 := 10;calculate_output_#res := 22; 1685#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 2186#L606-3 assume true; 2184#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 2182#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 2180#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 2178#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 2176#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 2174#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 2172#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 2170#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 2168#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 2166#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 2164#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 2162#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 2160#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 2158#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 2156#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 2154#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 2152#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 2149#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 2147#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 2145#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 2143#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 2141#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 2139#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 2137#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 2135#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 2133#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 2131#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 2129#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 2127#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 2125#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 2123#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 2121#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 2119#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 2117#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 2115#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 2113#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 2111#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 2109#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 2107#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 2105#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 2103#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 2101#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 2099#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 2097#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 2095#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 2093#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 2091#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 2090#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 2088#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 1782#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1674#L606-3 [2018-11-10 06:59:10,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:59:10,428 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-10 06:59:10,428 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:59:10,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:59:10,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:59:10,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:59:10,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:59:10,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:59:10,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:59:10,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:59:10,440 INFO L82 PathProgramCache]: Analyzing trace with hash 692590236, now seen corresponding path program 1 times [2018-11-10 06:59:10,441 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:59:10,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:59:10,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:59:10,441 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:59:10,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:59:10,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:59:10,501 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:59:10,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:59:10,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 06:59:10,501 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 06:59:10,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 06:59:10,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 06:59:10,502 INFO L87 Difference]: Start difference. First operand 660 states and 918 transitions. cyclomatic complexity: 259 Second operand 4 states. [2018-11-10 06:59:11,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:59:11,114 INFO L93 Difference]: Finished difference Result 1228 states and 1697 transitions. [2018-11-10 06:59:11,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 06:59:11,115 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1228 states and 1697 transitions. [2018-11-10 06:59:11,122 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1224 [2018-11-10 06:59:11,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1228 states to 1228 states and 1697 transitions. [2018-11-10 06:59:11,128 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1228 [2018-11-10 06:59:11,130 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1228 [2018-11-10 06:59:11,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1228 states and 1697 transitions. [2018-11-10 06:59:11,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 06:59:11,132 INFO L705 BuchiCegarLoop]: Abstraction has 1228 states and 1697 transitions. [2018-11-10 06:59:11,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states and 1697 transitions. [2018-11-10 06:59:11,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1225. [2018-11-10 06:59:11,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2018-11-10 06:59:11,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1691 transitions. [2018-11-10 06:59:11,200 INFO L728 BuchiCegarLoop]: Abstraction has 1225 states and 1691 transitions. [2018-11-10 06:59:11,200 INFO L608 BuchiCegarLoop]: Abstraction has 1225 states and 1691 transitions. [2018-11-10 06:59:11,201 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 06:59:11,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1225 states and 1691 transitions. [2018-11-10 06:59:11,206 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1221 [2018-11-10 06:59:11,206 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:59:11,206 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:59:11,207 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 06:59:11,207 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:59:11,207 INFO L793 eck$LassoCheckResult]: Stem: 3690#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 3567#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 3568#L606-3 [2018-11-10 06:59:11,208 INFO L795 eck$LassoCheckResult]: Loop: 3568#L606-3 assume true; 4605#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4601#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 4597#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 4593#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 4589#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 4585#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 4581#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 4462#L50 assume ~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7;~a28~0 := 11;~a25~0 := 1;calculate_output_#res := 26; 3748#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4443#L606-3 assume true; 4359#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4356#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 4189#L30 assume ((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 3789#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4175#L606-3 assume true; 4173#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4171#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 4169#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 4167#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 4165#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 4163#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 4161#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 4159#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 4157#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 4155#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 4153#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 4151#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 4149#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 4147#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 4145#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 4143#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 4141#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 4139#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 4137#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 4135#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 4133#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 4131#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 4129#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 4127#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 4125#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 4123#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 4121#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 4119#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 4117#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 4115#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 4113#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 4111#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 4109#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 4107#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 4105#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 4103#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 4101#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 4099#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 4097#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 4095#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 4093#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 4091#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 4089#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 4087#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 4085#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 4083#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 4081#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 4079#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 4076#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 4077#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3568#L606-3 [2018-11-10 06:59:11,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:59:11,208 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-10 06:59:11,208 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:59:11,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:59:11,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:59:11,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:59:11,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:59:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:59:11,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:59:11,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:59:11,212 INFO L82 PathProgramCache]: Analyzing trace with hash 676565178, now seen corresponding path program 1 times [2018-11-10 06:59:11,212 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:59:11,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:59:11,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:59:11,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:59:11,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:59:11,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:59:11,237 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 06:59:11,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:59:11,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:59:11,238 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 06:59:11,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:59:11,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:59:11,238 INFO L87 Difference]: Start difference. First operand 1225 states and 1691 transitions. cyclomatic complexity: 468 Second operand 3 states. [2018-11-10 06:59:11,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:59:11,574 INFO L93 Difference]: Finished difference Result 1509 states and 2000 transitions. [2018-11-10 06:59:11,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:59:11,575 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1509 states and 2000 transitions. [2018-11-10 06:59:11,579 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1505 [2018-11-10 06:59:11,583 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1509 states to 1509 states and 2000 transitions. [2018-11-10 06:59:11,583 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1509 [2018-11-10 06:59:11,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1509 [2018-11-10 06:59:11,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1509 states and 2000 transitions. [2018-11-10 06:59:11,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 06:59:11,586 INFO L705 BuchiCegarLoop]: Abstraction has 1509 states and 2000 transitions. [2018-11-10 06:59:11,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states and 2000 transitions. [2018-11-10 06:59:11,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1508. [2018-11-10 06:59:11,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1508 states. [2018-11-10 06:59:11,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 1998 transitions. [2018-11-10 06:59:11,599 INFO L728 BuchiCegarLoop]: Abstraction has 1508 states and 1998 transitions. [2018-11-10 06:59:11,599 INFO L608 BuchiCegarLoop]: Abstraction has 1508 states and 1998 transitions. [2018-11-10 06:59:11,599 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 06:59:11,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1508 states and 1998 transitions. [2018-11-10 06:59:11,602 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-10 06:59:11,603 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:59:11,603 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:59:11,604 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 06:59:11,604 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:59:11,604 INFO L793 eck$LassoCheckResult]: Stem: 6433#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 6307#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 6308#L606-3 [2018-11-10 06:59:11,604 INFO L795 eck$LassoCheckResult]: Loop: 6308#L606-3 assume true; 7590#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7588#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 7586#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 7584#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 7582#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 7580#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 7578#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 7576#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 7574#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 7572#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 7570#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 7568#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 7566#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 7564#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 7563#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 7562#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 7560#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 7559#L106 assume (~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1;~a17~0 := 8;~a25~0 := 0;~a19~0 := 0;~a28~0 := 11;~a11~0 := 0;calculate_output_#res := 23; 6542#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6972#L606-3 assume true; 6971#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6969#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6968#L30 assume ((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 6532#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6934#L606-3 assume true; 6932#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6930#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6928#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 6926#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 6924#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 6922#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 6920#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 6918#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 6916#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 6914#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 6912#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 6910#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 6908#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 6906#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 6904#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 6902#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 6900#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 6898#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 6896#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 6894#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 6892#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 6890#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 6888#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 6886#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 6884#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 6882#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 6880#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 6878#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 6876#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 6874#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 6872#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 6870#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 6868#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 6866#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 6864#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 6861#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 6859#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 6857#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 6855#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 6853#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 6851#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 6849#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 6847#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 6845#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 6843#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 6841#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 6839#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 6837#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 6834#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 6835#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6308#L606-3 [2018-11-10 06:59:11,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:59:11,605 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-10 06:59:11,605 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:59:11,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:59:11,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:59:11,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:59:11,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:59:11,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:59:11,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:59:11,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:59:11,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1219893882, now seen corresponding path program 1 times [2018-11-10 06:59:11,613 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:59:11,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:59:11,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:59:11,613 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:59:11,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:59:11,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:59:11,655 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 06:59:11,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:59:11,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:59:11,655 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 06:59:11,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:59:11,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:59:11,656 INFO L87 Difference]: Start difference. First operand 1508 states and 1998 transitions. cyclomatic complexity: 492 Second operand 3 states. [2018-11-10 06:59:12,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:59:12,023 INFO L93 Difference]: Finished difference Result 1507 states and 1821 transitions. [2018-11-10 06:59:12,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:59:12,025 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1507 states and 1821 transitions. [2018-11-10 06:59:12,030 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-10 06:59:12,035 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1507 states to 1507 states and 1821 transitions. [2018-11-10 06:59:12,036 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1507 [2018-11-10 06:59:12,037 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1507 [2018-11-10 06:59:12,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1507 states and 1821 transitions. [2018-11-10 06:59:12,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 06:59:12,038 INFO L705 BuchiCegarLoop]: Abstraction has 1507 states and 1821 transitions. [2018-11-10 06:59:12,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states and 1821 transitions. [2018-11-10 06:59:12,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1507. [2018-11-10 06:59:12,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2018-11-10 06:59:12,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1821 transitions. [2018-11-10 06:59:12,055 INFO L728 BuchiCegarLoop]: Abstraction has 1507 states and 1821 transitions. [2018-11-10 06:59:12,055 INFO L608 BuchiCegarLoop]: Abstraction has 1507 states and 1821 transitions. [2018-11-10 06:59:12,055 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 06:59:12,055 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1507 states and 1821 transitions. [2018-11-10 06:59:12,060 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-10 06:59:12,060 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:59:12,060 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:59:12,061 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 06:59:12,062 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:59:12,062 INFO L793 eck$LassoCheckResult]: Stem: 9454#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 9328#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 9329#L606-3 [2018-11-10 06:59:12,062 INFO L795 eck$LassoCheckResult]: Loop: 9329#L606-3 assume true; 10125#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 10123#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 10122#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 10120#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 10119#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 10118#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 10117#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 10109#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 10110#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 10103#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 10104#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 10651#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 10646#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 10642#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 10638#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 10633#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 10630#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 9899#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 9900#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 10059#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 10057#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 10055#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 10053#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 10051#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 10049#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 10047#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 10045#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 10043#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 9786#L165 assume (~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1);~a25~0 := 1;~a28~0 := 9;calculate_output_#res := 26; 9677#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9779#L606-3 assume true; 9777#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 9775#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 9773#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 9771#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 9769#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 9767#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 9765#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 9763#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 9761#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 9759#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 9757#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 9755#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 9753#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 9751#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 9749#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 9747#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 9745#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 9743#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 9741#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 9739#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 9737#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 9735#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 9733#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 9731#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 9729#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 9727#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 9725#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 9722#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 9720#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 9718#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 9716#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 9714#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 9712#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 9710#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 9708#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 9706#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 9704#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 9702#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 9700#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 9698#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 9696#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 9694#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 9692#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 9690#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 9688#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 9686#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 9684#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 9682#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 9679#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 9680#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9329#L606-3 [2018-11-10 06:59:12,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:59:12,062 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-10 06:59:12,062 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:59:12,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:59:12,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:59:12,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:59:12,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:59:12,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:59:12,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:59:12,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:59:12,066 INFO L82 PathProgramCache]: Analyzing trace with hash -606648447, now seen corresponding path program 1 times [2018-11-10 06:59:12,066 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:59:12,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:59:12,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:59:12,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:59:12,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:59:12,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:59:12,110 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:59:12,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:59:12,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:59:12,110 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 06:59:12,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:59:12,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:59:12,111 INFO L87 Difference]: Start difference. First operand 1507 states and 1821 transitions. cyclomatic complexity: 316 Second operand 3 states. [2018-11-10 06:59:12,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:59:12,355 INFO L93 Difference]: Finished difference Result 1496 states and 1777 transitions. [2018-11-10 06:59:12,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:59:12,356 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1496 states and 1777 transitions. [2018-11-10 06:59:12,361 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-10 06:59:12,366 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1496 states to 1496 states and 1777 transitions. [2018-11-10 06:59:12,367 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1496 [2018-11-10 06:59:12,368 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1496 [2018-11-10 06:59:12,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1496 states and 1777 transitions. [2018-11-10 06:59:12,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 06:59:12,370 INFO L705 BuchiCegarLoop]: Abstraction has 1496 states and 1777 transitions. [2018-11-10 06:59:12,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states and 1777 transitions. [2018-11-10 06:59:12,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1496. [2018-11-10 06:59:12,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2018-11-10 06:59:12,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 1777 transitions. [2018-11-10 06:59:12,387 INFO L728 BuchiCegarLoop]: Abstraction has 1496 states and 1777 transitions. [2018-11-10 06:59:12,387 INFO L608 BuchiCegarLoop]: Abstraction has 1496 states and 1777 transitions. [2018-11-10 06:59:12,387 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 06:59:12,388 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1496 states and 1777 transitions. [2018-11-10 06:59:12,392 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-10 06:59:12,392 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:59:12,392 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:59:12,392 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 06:59:12,393 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:59:12,393 INFO L793 eck$LassoCheckResult]: Stem: 12462#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 12337#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 12338#L606-3 [2018-11-10 06:59:12,394 INFO L795 eck$LassoCheckResult]: Loop: 12338#L606-3 assume true; 13273#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 13271#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 13269#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 13267#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 13265#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 13263#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 13261#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 13259#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 13257#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 13255#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 13253#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 13251#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 13250#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 13249#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 13247#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 13245#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 13243#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 13241#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 13239#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 13237#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 13236#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 13234#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 13232#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 13230#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 13228#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13226#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 13224#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 13222#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 13220#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 13218#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 13216#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 13214#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 13212#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 13210#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 13208#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 13206#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 13204#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 13202#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 13200#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 13198#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 13196#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 13194#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 13192#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 13190#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 13188#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 13186#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 13184#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 13182#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 13180#L253 assume !((~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9); 13178#L259 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && (((~a28~0 == 9 && calculate_output_~input == 6) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a25~0 == 1)); 13176#L261 assume !(~a17~0 == 9 && ~a21~0 == 1 && ~a11~0 == 1 && (calculate_output_~input == 3 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7))) && ~a19~0 == 1); 13174#L276 assume !(~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && ~a21~0 == 1 && ~a19~0 == 1 && calculate_output_~input == 5 && !(~a11~0 == 1)); 13172#L280 assume !(~a28~0 == 8 && ~a21~0 == 1 && (!(~a11~0 == 1) && (calculate_output_~input == 1 && ~a17~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 13170#L283 assume !((((~a17~0 == 8 && (calculate_output_~input == 6 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a21~0 == 1) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a19~0 == 1); 13168#L286 assume !((!(~a11~0 == 1) && (!(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 11) || (~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 13166#L291 assume !(~a17~0 == 8 && (~a21~0 == 1 && !(~a11~0 == 1) && ~a25~0 == 1 && ~a28~0 == 8 && calculate_output_~input == 6) && ~a19~0 == 1); 13164#L293 assume !((~a19~0 == 1 && ~a17~0 == 8 && ((!(~a25~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11); 13162#L297 assume !(~a11~0 == 1 && (~a17~0 == 9 && ~a28~0 == 9 && ~a19~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a21~0 == 1); 13160#L309 assume !((((((calculate_output_~input == 3 && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a28~0 == 11) && !(~a11~0 == 1)); 13158#L314 assume !(~a19~0 == 1 && ~a21~0 == 1 && ((calculate_output_~input == 5 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7))) && ~a11~0 == 1) && ~a17~0 == 9); 13156#L328 assume !((~a19~0 == 1 && ((!(~a11~0 == 1) && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a28~0 == 10) && ~a21~0 == 1) && ~a17~0 == 8); 13154#L331 assume !((!(~a11~0 == 1) && (((calculate_output_~input == 4 && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1); 13152#L337 assume !(((!(~a19~0 == 1) && (calculate_output_~input == 4 && (((!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 13150#L349 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && ((~a25~0 == 1 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 11) && ~a21~0 == 1); 13148#L354 assume !((((~a21~0 == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a28~0 == 9 && ~a25~0 == 1)) && calculate_output_~input == 6) && !(~a11~0 == 1)) && !(~a19~0 == 1)) && ~a17~0 == 8); 13146#L361 assume !(~a19~0 == 1 && ((~a21~0 == 1 && (!(~a25~0 == 1) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a28~0 == 8) && ~a11~0 == 1); 13144#L368 assume !(~a17~0 == 8 && (~a21~0 == 1 && (calculate_output_~input == 5 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a28~0 == 9 && ~a25~0 == 1))) && ~a19~0 == 1) && !(~a11~0 == 1)); 13142#L375 assume !(~a19~0 == 1 && (((~a17~0 == 8 && calculate_output_~input == 5 && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a25~0 == 1) && ~a28~0 == 8); 13140#L378 assume !(((!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 4) && ~a28~0 == 10) && ~a17~0 == 8) && !(~a19~0 == 1)) && ~a25~0 == 1); 13138#L380 assume !(~a28~0 == 8 && (~a19~0 == 1 && ~a11~0 == 1 && !(~a25~0 == 1) && ~a17~0 == 9 && calculate_output_~input == 6) && ~a21~0 == 1); 13136#L389 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 6 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a17~0 == 8) && !(~a19~0 == 1)); 13134#L394 assume !(((((!(~a25~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 9) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 13132#L398 assume !((~a17~0 == 8 && ((calculate_output_~input == 4 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)); 13130#L402 assume !(((!(~a11~0 == 1) && ((~a19~0 == 1 && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)); 13128#L404 assume !((~a11~0 == 1 && ~a19~0 == 1 && ~a21~0 == 1 && (~a17~0 == 9 && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a28~0 == 8); 13126#L407 assume !(!(~a11~0 == 1) && ~a21~0 == 1 && (~a19~0 == 1 && ~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 5) && ~a28~0 == 11); 13124#L409 assume !(~a19~0 == 1 && ~a17~0 == 8 && ((((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3) && !(~a11~0 == 1)) && ~a21~0 == 1); 13122#L414 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13120#L414-2 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13118#L417-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13116#L420-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13114#L423-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13112#L426-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13110#L429-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13108#L432-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13106#L435-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 12355#L438-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13369#L441-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13368#L444-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13367#L447-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13366#L450-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13364#L453-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13362#L456-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13360#L459-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13358#L462-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13356#L465-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 12552#L468-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13355#L471-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13353#L474-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13351#L477-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13349#L480-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13347#L483-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13345#L486-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13343#L489-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13341#L492-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13339#L495-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13337#L498-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13335#L501-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13333#L504-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13331#L507-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13329#L510-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13327#L513-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 12493#L516-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13325#L519-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13324#L522-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13322#L525-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13320#L528-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13318#L531-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13316#L534-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13314#L537-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13312#L540-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13310#L543-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13308#L546-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13306#L549-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13304#L552-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13302#L555-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13300#L558-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13298#L561-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13296#L564-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13294#L567-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13292#L570-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13290#L573-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13289#L576-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13288#L579-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13286#L582-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13284#L585-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13282#L588-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13280#L591-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13278#L594-1 calculate_output_#res := -2; 13276#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 12338#L606-3 [2018-11-10 06:59:12,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:59:12,394 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-10 06:59:12,394 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:59:12,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:59:12,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:59:12,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:59:12,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:59:12,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:59:12,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:59:12,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:59:12,398 INFO L82 PathProgramCache]: Analyzing trace with hash 245249823, now seen corresponding path program 1 times [2018-11-10 06:59:12,398 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:59:12,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:59:12,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:59:12,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:59:12,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:59:12,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:59:12,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:59:12,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:59:12,434 INFO L82 PathProgramCache]: Analyzing trace with hash -2003304803, now seen corresponding path program 1 times [2018-11-10 06:59:12,434 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:59:12,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:59:12,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:59:12,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:59:12,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:59:12,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:59:12,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:59:12,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:59:12,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 06:59:13,485 WARN L179 SmtUtils]: Spent 640.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2018-11-10 06:59:13,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 06:59:13,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-10 06:59:13,558 INFO L87 Difference]: Start difference. First operand 1496 states and 1777 transitions. cyclomatic complexity: 284 Second operand 10 states. [2018-11-10 06:59:14,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:59:14,329 INFO L93 Difference]: Finished difference Result 1688 states and 1966 transitions. [2018-11-10 06:59:14,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 06:59:14,329 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1688 states and 1966 transitions. [2018-11-10 06:59:14,335 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1632 [2018-11-10 06:59:14,341 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1688 states to 1688 states and 1966 transitions. [2018-11-10 06:59:14,341 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1688 [2018-11-10 06:59:14,343 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1688 [2018-11-10 06:59:14,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1688 states and 1966 transitions. [2018-11-10 06:59:14,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 06:59:14,345 INFO L705 BuchiCegarLoop]: Abstraction has 1688 states and 1966 transitions. [2018-11-10 06:59:14,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states and 1966 transitions. [2018-11-10 06:59:14,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1546. [2018-11-10 06:59:14,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2018-11-10 06:59:14,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 1824 transitions. [2018-11-10 06:59:14,366 INFO L728 BuchiCegarLoop]: Abstraction has 1546 states and 1824 transitions. [2018-11-10 06:59:14,366 INFO L608 BuchiCegarLoop]: Abstraction has 1546 states and 1824 transitions. [2018-11-10 06:59:14,366 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 06:59:14,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1546 states and 1824 transitions. [2018-11-10 06:59:14,371 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1490 [2018-11-10 06:59:14,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:59:14,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:59:14,372 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:59:14,372 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:59:14,373 INFO L793 eck$LassoCheckResult]: Stem: 15663#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 15546#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 15547#L606-3 assume true; 16935#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16818#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 16813#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 16807#L35 assume ~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1);~a28~0 := 10;calculate_output_#res := 22; 15803#L597 [2018-11-10 06:59:14,373 INFO L795 eck$LassoCheckResult]: Loop: 15803#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 16731#L606-3 assume true; 16729#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16727#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 16725#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 16723#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 16721#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 16719#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 16717#L47 assume ((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10;~a25~0 := 0;calculate_output_#res := -1; 15803#L597 [2018-11-10 06:59:14,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:59:14,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1805984299, now seen corresponding path program 1 times [2018-11-10 06:59:14,373 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:59:14,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:59:14,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:59:14,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:59:14,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:59:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:59:14,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:59:14,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:59:14,380 INFO L82 PathProgramCache]: Analyzing trace with hash -278812021, now seen corresponding path program 1 times [2018-11-10 06:59:14,380 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:59:14,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:59:14,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:59:14,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:59:14,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:59:14,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:59:14,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:59:14,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:59:14,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1569761375, now seen corresponding path program 1 times [2018-11-10 06:59:14,387 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:59:14,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:59:14,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:59:14,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:59:14,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:59:14,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:59:14,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:59:14,589 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2018-11-10 06:59:14,616 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 06:59:14,617 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 06:59:14,617 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 06:59:14,617 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 06:59:14,617 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 06:59:14,617 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:59:14,617 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 06:59:14,617 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 06:59:14,617 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label25_true-unreach-call_false-termination.c_Iteration8_Lasso [2018-11-10 06:59:14,617 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 06:59:14,617 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 06:59:14,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:59:14,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:59:14,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:59:14,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:59:14,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:59:14,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:59:14,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:59:14,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:59:14,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:59:14,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:59:14,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:59:14,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:59:14,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:59:14,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:59:14,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:59:14,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:59:14,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:59:14,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:59:14,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:59:14,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:59:14,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:59:14,841 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 06:59:14,841 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/bin-2019/uautomizer/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 [2018-11-10 06:59:14,845 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:59:14,845 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:59:14,847 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:59:14,847 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~u~0=0} Honda state: {~u~0=21} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/bin-2019/uautomizer/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 [2018-11-10 06:59:14,863 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:59:14,863 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:59:14,878 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:59:14,878 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~f~0=0} Honda state: {~f~0=6} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/bin-2019/uautomizer/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 [2018-11-10 06:59:14,882 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:59:14,882 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:59:14,884 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:59:14,884 INFO L446 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 /tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/bin-2019/uautomizer/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 [2018-11-10 06:59:14,901 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:59:14,901 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:59:14,904 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:59:14,904 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~y~0=0} Honda state: {~y~0=25} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/bin-2019/uautomizer/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 [2018-11-10 06:59:14,923 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:59:14,923 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:59:14,926 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:59:14,926 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~z~0=0} Honda state: {~z~0=26} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/bin-2019/uautomizer/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 [2018-11-10 06:59:14,943 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:59:14,944 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:59:14,959 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:59:14,959 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=0} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/bin-2019/uautomizer/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:59:14,964 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:59:14,964 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:59:14,966 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:59:14,966 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~v~0=0} Honda state: {~v~0=22} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/bin-2019/uautomizer/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 [2018-11-10 06:59:14,982 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:59:14,982 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:59:14,998 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:59:14,998 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a~0=0} Honda state: {~a~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/bin-2019/uautomizer/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 [2018-11-10 06:59:15,001 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:59:15,001 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:59:15,017 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:59:15,017 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=0} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/bin-2019/uautomizer/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 [2018-11-10 06:59:15,020 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:59:15,020 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:59:15,022 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:59:15,022 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/bin-2019/uautomizer/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 [2018-11-10 06:59:15,038 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:59:15,039 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:59:15,054 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:59:15,054 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~e~0=0} Honda state: {~e~0=5} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/bin-2019/uautomizer/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 [2018-11-10 06:59:15,057 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:59:15,057 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:59:15,073 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:59:15,073 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~d~0=0} Honda state: {~d~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/bin-2019/uautomizer/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 [2018-11-10 06:59:15,076 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:59:15,076 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:59:15,078 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:59:15,078 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~w~0=0} Honda state: {~w~0=23} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/bin-2019/uautomizer/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 [2018-11-10 06:59:15,094 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:59:15,094 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:59:15,096 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:59:15,096 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a25~0=0} Honda state: {~a25~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/bin-2019/uautomizer/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 [2018-11-10 06:59:15,112 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:59:15,112 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:59:15,127 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:59:15,128 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c~0=0} Honda state: {~c~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/bin-2019/uautomizer/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 [2018-11-10 06:59:15,130 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:59:15,130 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/bin-2019/uautomizer/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 [2018-11-10 06:59:15,150 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 06:59:15,150 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:59:15,345 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:59:15,345 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#in~input=0, ULTIMATE.start_calculate_output_~input=0, ULTIMATE.start_main_~input~0=0, ULTIMATE.start_main_#t~nondet2=0} Honda state: {ULTIMATE.start_calculate_output_#in~input=6, ULTIMATE.start_calculate_output_~input=6, ULTIMATE.start_main_~input~0=6, ULTIMATE.start_main_#t~nondet2=1} Generalized eigenvectors: [{ULTIMATE.start_calculate_output_#in~input=4, ULTIMATE.start_calculate_output_~input=3, ULTIMATE.start_main_~input~0=5, ULTIMATE.start_main_#t~nondet2=0}, {ULTIMATE.start_calculate_output_#in~input=-4, ULTIMATE.start_calculate_output_~input=-3, ULTIMATE.start_main_~input~0=-5, ULTIMATE.start_main_#t~nondet2=0}, {ULTIMATE.start_calculate_output_#in~input=-5, ULTIMATE.start_calculate_output_~input=-5, ULTIMATE.start_main_~input~0=-5, ULTIMATE.start_main_#t~nondet2=0}] Lambdas: [1, 0, 0] Nus: [1, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/bin-2019/uautomizer/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 [2018-11-10 06:59:15,365 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:59:15,366 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:59:15,368 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:59:15,368 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~x~0=0} Honda state: {~x~0=24} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/bin-2019/uautomizer/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 [2018-11-10 06:59:15,384 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:59:15,384 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/bin-2019/uautomizer/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 [2018-11-10 06:59:15,401 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 06:59:15,401 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:59:15,551 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:59:15,551 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=0} Honda state: {ULTIMATE.start_calculate_output_#res=22, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [{ULTIMATE.start_calculate_output_#res=-23, ULTIMATE.start_main_~output~0=22}, {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=-23}, {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=24}] Lambdas: [0, 0, 0] Nus: [1, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/bin-2019/uautomizer/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 [2018-11-10 06:59:15,569 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:59:15,569 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:59:15,584 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:59:15,585 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=0} Honda state: {~a19~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/bin-2019/uautomizer/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 [2018-11-10 06:59:15,588 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:59:15,588 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:59:15,590 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:59:15,590 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a11~0=0} Honda state: {~a11~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/bin-2019/uautomizer/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 [2018-11-10 06:59:15,606 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:59:15,606 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:59:15,608 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:59:15,608 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a28~0=0} Honda state: {~a28~0=10} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2018-11-10 06:59:15,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 06:59:15 BoogieIcfgContainer [2018-11-10 06:59:15,644 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 06:59:15,645 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 06:59:15,645 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 06:59:15,645 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 06:59:15,645 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:59:06" (3/4) ... [2018-11-10 06:59:15,648 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-10 06:59:15,684 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_da174cde-38fe-4648-a817-fb4de21bc62d/bin-2019/uautomizer/witness.graphml [2018-11-10 06:59:15,684 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 06:59:15,685 INFO L168 Benchmark]: Toolchain (without parser) took 10561.10 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 480.8 MB). Free memory was 955.4 MB in the beginning and 1.1 GB in the end (delta: -109.5 MB). Peak memory consumption was 371.3 MB. Max. memory is 11.5 GB. [2018-11-10 06:59:15,685 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 06:59:15,686 INFO L168 Benchmark]: CACSL2BoogieTranslator took 370.52 ms. Allocated memory is still 1.0 GB. Free memory was 955.4 MB in the beginning and 920.5 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. [2018-11-10 06:59:15,686 INFO L168 Benchmark]: Boogie Procedure Inliner took 103.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 920.5 MB in the beginning and 1.1 GB in the end (delta: -207.6 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-11-10 06:59:15,686 INFO L168 Benchmark]: Boogie Preprocessor took 41.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-10 06:59:15,686 INFO L168 Benchmark]: RCFGBuilder took 847.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 104.0 MB). Peak memory consumption was 104.0 MB. Max. memory is 11.5 GB. [2018-11-10 06:59:15,687 INFO L168 Benchmark]: BuchiAutomizer took 9154.69 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 335.0 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -47.7 MB). Peak memory consumption was 530.8 MB. Max. memory is 11.5 GB. [2018-11-10 06:59:15,687 INFO L168 Benchmark]: Witness Printer took 39.70 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 06:59:15,689 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 370.52 ms. Allocated memory is still 1.0 GB. Free memory was 955.4 MB in the beginning and 920.5 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 103.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 920.5 MB in the beginning and 1.1 GB in the end (delta: -207.6 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 847.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 104.0 MB). Peak memory consumption was 104.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9154.69 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 335.0 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -47.7 MB). Peak memory consumption was 530.8 MB. Max. memory is 11.5 GB. * Witness Printer took 39.70 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 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 7 terminating modules (7 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.7 modules have a trivial ranking function, the largest among these consists of 10 locations. The remainder module has 1546 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.1s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 5.4s. Construction of modules took 2.4s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 147 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 1546 states and ocurred in iteration 7. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1469 SDtfs, 3081 SDslu, 490 SDs, 0 SdLazy, 3703 SolverSat, 847 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time LassoAnalysisResults: nont1 unkn0 SFLI4 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital65 mio100 ax100 hnf103 lsp39 ukn90 mio100 lsp100 div100 bol100 ite100 ukn100 eq209 hnf93 smp100 dnf148 smp89 tf102 neg98 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 66ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 0 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 31 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.9s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - GeometricNonTerminationArgumentResult [Line: 614]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {a19=0, a17=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4be1c285=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1934dc09=0, y=0, x=0, z=0, u=0, w=0, v=0, a=0, c=0, a28=0, \old(input)=0, output=0, a25=0, a21=0, d=0, e=0, f=0, input=0, input=0} State at position 1 is {a19=1, a17=8, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4be1c285=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1934dc09=1, y=25, x=24, z=26, u=21, w=23, v=22, a=1, c=3, a28=10, \old(input)=6, output=-1, a25=0, a21=1, d=4, e=5, f=6, input=6, input=6} For i>1, the state at position i is {a19=1 + sum_{k=0}^i 0, a17=8 + sum_{k=0}^i 0, \result=0 + sum_{k=0}^i 0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4be1c285=0 + sum_{k=0}^i 0, a11=0 + sum_{k=0}^i 0, \result=22 + sum_{k=0}^i -23*0^k, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1934dc09=1 + sum_{k=0}^i 0, y=25 + sum_{k=0}^i 0, x=24 + sum_{k=0}^i 0, z=26 + sum_{k=0}^i 0, u=21 + sum_{k=0}^i 0, w=23 + sum_{k=0}^i 0, v=22 + sum_{k=0}^i 0, a=1 + sum_{k=0}^i 0, c=3 + sum_{k=0}^i 0, a28=10 + sum_{k=0}^i 0, \old(input)=6 + sum_{k=0}^i 4 + -4*0^k + -4*k + -5*0^k, output=-1 + sum_{k=0}^i 22*0^k + -23*0^k + -23*k*0^(k-1) + 24*0^k, a25=0 + sum_{k=0}^i 0, a21=1 + sum_{k=0}^i 0, d=4 + sum_{k=0}^i 0, e=5 + sum_{k=0}^i 0, f=6 + sum_{k=0}^i 0, input=6 + sum_{k=0}^i 5 + -5*0^k + -5*k + -5*0^k, input=6 + sum_{k=0}^i 3 + -3*0^k + -3*k + -5*0^k} - StatisticsResult: NonterminationArgumentStatistics Unbounded Execution 6GEVs Lambdas: [1, 0, 0, 0, 0, 0] Mus: [1, 0, 0, 1, 0] - NonterminatingLassoResult [Line: 29]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND TRUE ((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1))) [L36] a28 = 10 [L37] return 22; Loop: [L614] RET, EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND TRUE ((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10)) [L48] a25 = 0 [L49] return -1; End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...