./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label23_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_3da76c5a-7328-4332-a477-0e7196732999/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3da76c5a-7328-4332-a477-0e7196732999/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3da76c5a-7328-4332-a477-0e7196732999/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3da76c5a-7328-4332-a477-0e7196732999/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label23_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3da76c5a-7328-4332-a477-0e7196732999/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3da76c5a-7328-4332-a477-0e7196732999/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 a07d46acee19a1bf676413a71857b7cd94a5f704 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 11:53:26,696 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 11:53:26,697 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 11:53:26,703 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 11:53:26,704 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 11:53:26,704 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 11:53:26,705 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 11:53:26,706 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 11:53:26,707 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 11:53:26,708 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 11:53:26,709 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 11:53:26,709 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 11:53:26,709 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 11:53:26,710 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 11:53:26,711 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 11:53:26,711 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 11:53:26,712 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 11:53:26,713 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 11:53:26,715 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 11:53:26,716 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 11:53:26,716 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 11:53:26,717 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 11:53:26,719 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 11:53:26,719 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 11:53:26,722 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 11:53:26,723 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 11:53:26,724 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 11:53:26,724 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 11:53:26,725 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 11:53:26,725 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 11:53:26,725 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 11:53:26,726 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 11:53:26,726 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 11:53:26,726 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 11:53:26,727 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 11:53:26,727 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 11:53:26,727 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3da76c5a-7328-4332-a477-0e7196732999/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 11:53:26,735 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 11:53:26,735 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 11:53:26,736 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 11:53:26,736 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 11:53:26,737 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 11:53:26,737 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 11:53:26,737 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 11:53:26,737 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 11:53:26,737 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 11:53:26,737 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 11:53:26,737 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 11:53:26,737 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 11:53:26,738 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 11:53:26,738 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 11:53:26,738 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 11:53:26,738 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 11:53:26,738 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 11:53:26,738 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 11:53:26,738 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 11:53:26,738 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 11:53:26,739 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 11:53:26,739 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 11:53:26,739 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 11:53:26,739 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 11:53:26,739 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 11:53:26,739 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 11:53:26,739 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 11:53:26,739 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 11:53:26,740 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 11:53:26,740 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 11:53:26,740 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 11:53:26,741 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_3da76c5a-7328-4332-a477-0e7196732999/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 -> a07d46acee19a1bf676413a71857b7cd94a5f704 [2018-11-10 11:53:26,762 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 11:53:26,770 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 11:53:26,772 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 11:53:26,773 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 11:53:26,773 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 11:53:26,774 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3da76c5a-7328-4332-a477-0e7196732999/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label23_true-unreach-call_false-termination.c [2018-11-10 11:53:26,808 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3da76c5a-7328-4332-a477-0e7196732999/bin-2019/uautomizer/data/75f216a28/55b2010c721a4fbcaa31077b50eef520/FLAGd3d17964e [2018-11-10 11:53:27,157 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 11:53:27,158 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3da76c5a-7328-4332-a477-0e7196732999/sv-benchmarks/c/eca-rers2012/Problem02_label23_true-unreach-call_false-termination.c [2018-11-10 11:53:27,167 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3da76c5a-7328-4332-a477-0e7196732999/bin-2019/uautomizer/data/75f216a28/55b2010c721a4fbcaa31077b50eef520/FLAGd3d17964e [2018-11-10 11:53:27,179 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3da76c5a-7328-4332-a477-0e7196732999/bin-2019/uautomizer/data/75f216a28/55b2010c721a4fbcaa31077b50eef520 [2018-11-10 11:53:27,182 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 11:53:27,183 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 11:53:27,184 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 11:53:27,184 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 11:53:27,187 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 11:53:27,188 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:53:27" (1/1) ... [2018-11-10 11:53:27,190 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@505fd6fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:53:27, skipping insertion in model container [2018-11-10 11:53:27,190 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:53:27" (1/1) ... [2018-11-10 11:53:27,197 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 11:53:27,232 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 11:53:27,467 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:53:27,470 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 11:53:27,535 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:53:27,548 INFO L193 MainTranslator]: Completed translation [2018-11-10 11:53:27,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:53:27 WrapperNode [2018-11-10 11:53:27,548 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 11:53:27,549 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 11:53:27,549 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 11:53:27,549 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 11:53:27,556 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:53:27" (1/1) ... [2018-11-10 11:53:27,568 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:53:27" (1/1) ... [2018-11-10 11:53:27,656 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 11:53:27,656 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 11:53:27,656 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 11:53:27,657 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 11:53:27,665 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:53:27" (1/1) ... [2018-11-10 11:53:27,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:53:27" (1/1) ... [2018-11-10 11:53:27,668 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:53:27" (1/1) ... [2018-11-10 11:53:27,669 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:53:27" (1/1) ... [2018-11-10 11:53:27,681 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:53:27" (1/1) ... [2018-11-10 11:53:27,690 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:53:27" (1/1) ... [2018-11-10 11:53:27,694 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:53:27" (1/1) ... [2018-11-10 11:53:27,699 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 11:53:27,699 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 11:53:27,700 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 11:53:27,700 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 11:53:27,700 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:53:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3da76c5a-7328-4332-a477-0e7196732999/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 11:53:27,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 11:53:27,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 11:53:28,513 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 11:53:28,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:53:28 BoogieIcfgContainer [2018-11-10 11:53:28,514 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 11:53:28,514 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 11:53:28,515 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 11:53:28,519 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 11:53:28,519 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:53:28,519 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 11:53:27" (1/3) ... [2018-11-10 11:53:28,520 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a59738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:53:28, skipping insertion in model container [2018-11-10 11:53:28,520 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:53:28,520 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:53:27" (2/3) ... [2018-11-10 11:53:28,520 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a59738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:53:28, skipping insertion in model container [2018-11-10 11:53:28,521 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:53:28,521 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:53:28" (3/3) ... [2018-11-10 11:53:28,522 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label23_true-unreach-call_false-termination.c [2018-11-10 11:53:28,555 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 11:53:28,556 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 11:53:28,556 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 11:53:28,556 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 11:53:28,556 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 11:53:28,556 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 11:53:28,556 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 11:53:28,556 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 11:53:28,556 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 11:53:28,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-10 11:53:28,593 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-10 11:53:28,593 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:53:28,593 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:53:28,600 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 11:53:28,600 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 11:53:28,600 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 11:53:28,600 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-10 11:53:28,606 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-10 11:53:28,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:53:28,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:53:28,607 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 11:53:28,607 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 11:53:28,612 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 11:53:28,612 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 11:53:28,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:53:28,616 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 11:53:28,618 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:53:28,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:53:28,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:28,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:53:28,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:53:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:53:28,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:53:28,685 INFO L82 PathProgramCache]: Analyzing trace with hash 34545679, now seen corresponding path program 1 times [2018-11-10 11:53:28,685 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:53:28,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:53:28,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:28,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:53:28,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:28,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:53:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:53:28,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:53:28,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1805985165, now seen corresponding path program 1 times [2018-11-10 11:53:28,706 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:53:28,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:53:28,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:28,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:53:28,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:28,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:53:28,777 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 11:53:28,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:53:28,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 11:53:28,884 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:53:28,885 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:53:28,885 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:53:28,885 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:53:28,886 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 11:53:28,886 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:53:28,886 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:53:28,886 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:53:28,886 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label23_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-10 11:53:28,886 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:53:28,886 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:53:28,906 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 11:53:28,911 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 11:53:28,946 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 11:53:28,949 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 11:53:28,954 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 11:53:28,956 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 11:53:28,958 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 11:53:28,964 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 11:53:29,128 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:53:29,129 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3da76c5a-7328-4332-a477-0e7196732999/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 11:53:29,135 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:53:29,135 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:53:29,169 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:53:29,169 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_3da76c5a-7328-4332-a477-0e7196732999/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 11:53:29,175 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:53:29,176 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:53:29,183 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:53:29,183 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_3da76c5a-7328-4332-a477-0e7196732999/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 11:53:29,208 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:53:29,208 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:53:29,235 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:53:29,235 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_3da76c5a-7328-4332-a477-0e7196732999/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 11:53:29,243 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:53:29,244 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:53:29,251 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:53:29,251 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_3da76c5a-7328-4332-a477-0e7196732999/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) [2018-11-10 11:53:29,294 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:53:29,295 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:53:29,331 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:53:29,331 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_3da76c5a-7328-4332-a477-0e7196732999/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 11:53:29,344 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:53:29,344 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:53:29,347 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:53:29,347 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_3da76c5a-7328-4332-a477-0e7196732999/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 11:53:29,384 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:53:29,384 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:53:29,407 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:53:29,407 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_3da76c5a-7328-4332-a477-0e7196732999/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 11:53:29,436 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:53:29,436 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3da76c5a-7328-4332-a477-0e7196732999/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 11:53:29,471 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 11:53:29,471 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:53:29,519 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 11:53:29,520 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:53:29,521 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:53:29,521 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:53:29,521 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:53:29,521 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 11:53:29,521 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:53:29,521 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:53:29,521 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:53:29,522 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label23_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-10 11:53:29,522 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:53:29,522 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:53:29,524 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 11:53:29,547 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 11:53:29,550 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 11:53:29,579 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 11:53:29,585 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 11:53:29,588 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 11:53:29,593 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 11:53:29,596 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 11:53:29,765 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:53:29,768 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 11:53:29,769 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 11:53:29,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:29,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:29,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:29,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:29,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:53:29,773 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:53:29,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:29,781 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:29,781 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 11:53:29,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:29,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:29,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:29,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:29,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:53:29,783 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:53:29,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:29,785 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:29,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 11:53:29,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:29,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:29,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:29,786 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 11:53:29,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:53:29,790 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:53:29,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:29,807 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:29,807 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 11:53:29,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:29,808 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:29,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:29,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:29,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:53:29,809 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:53:29,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:29,812 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:29,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 11:53:29,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:29,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:29,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:29,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:29,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:53:29,813 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:53:29,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:29,815 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:29,815 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 11:53:29,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:29,816 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:29,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:29,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:29,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:53:29,817 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:53:29,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:29,818 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:29,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 11:53:29,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:29,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:29,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:29,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:29,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:53:29,820 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:53:29,820 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:29,820 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:29,821 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 11:53:29,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:29,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:29,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:29,821 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:53:29,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:53:29,822 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:53:29,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:29,825 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:29,826 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 11:53:29,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 11:53:29,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:29,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:29,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:29,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:29,827 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:53:29,828 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:53:29,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:29,836 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:29,836 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 11:53:29,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:29,837 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:29,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:29,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:29,837 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:53:29,838 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:53:29,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:29,840 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:29,840 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 11:53:29,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:29,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:29,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:29,841 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 11:53:29,841 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:53:29,844 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 11:53:29,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:29,864 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:29,864 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 11:53:29,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:29,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:29,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:29,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:29,865 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:53:29,865 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:53:29,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:29,870 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:29,871 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 11:53:29,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:29,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:29,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:29,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:29,872 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:53:29,872 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:53:29,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:29,874 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:29,874 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 11:53:29,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:29,874 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:29,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:29,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:29,875 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:53:29,875 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:53:29,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:29,877 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:29,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 11:53:29,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:29,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:29,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:29,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:29,878 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:53:29,878 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:53:29,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:29,879 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:29,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 11:53:29,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:29,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:29,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:29,880 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:53:29,880 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:53:29,881 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:53:29,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:29,888 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:29,888 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 11:53:29,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 11:53:29,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:29,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:29,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:29,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:29,889 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:53:29,892 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:53:29,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:29,897 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:29,897 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 11:53:29,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:29,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:29,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:29,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:29,898 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:53:29,899 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:53:29,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:29,900 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:29,901 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 11:53:29,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:29,901 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:29,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:29,902 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 11:53:29,902 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:53:29,903 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 11:53:29,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:29,914 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:29,914 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 11:53:29,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:29,915 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:29,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:29,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:29,915 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:53:29,916 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:53:29,916 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:29,919 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:29,919 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 11:53:29,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:29,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:29,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:29,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:29,920 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:53:29,920 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:53:29,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:29,922 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:29,922 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 11:53:29,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:29,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:29,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:29,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:29,923 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:53:29,923 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:53:29,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:29,925 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:29,925 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 11:53:29,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:29,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:29,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:29,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:29,926 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:53:29,926 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:53:29,927 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:29,927 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:29,927 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 11:53:29,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:29,928 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:29,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:29,928 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:53:29,928 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:53:29,929 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 11:53:29,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:29,932 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:29,932 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 11:53:29,933 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 11:53:29,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:29,933 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:29,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:29,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:29,934 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:53:29,935 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:53:29,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:29,940 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:29,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 11:53:29,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:29,940 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:29,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:29,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:29,941 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:53:29,941 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:53:29,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:29,943 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:29,943 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 11:53:29,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:29,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:29,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:29,944 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 11:53:29,944 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:53:29,946 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-10 11:53:29,946 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:29,957 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:29,957 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 11:53:29,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:29,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:29,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:29,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:29,958 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:53:29,959 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:53:29,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:29,962 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:29,962 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 11:53:29,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:29,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:29,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:29,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:29,963 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:53:29,963 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:53:29,963 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:29,965 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:29,965 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 11:53:29,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:29,965 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:29,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:29,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:29,966 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:53:29,966 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:53:29,966 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:29,968 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:29,968 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 11:53:29,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:29,969 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:29,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:29,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:29,969 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:53:29,969 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:53:29,970 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:29,970 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:29,970 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 11:53:29,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:29,971 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:29,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:29,971 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:53:29,971 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:53:29,972 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 11:53:29,972 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:29,975 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:29,976 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 11:53:29,976 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 11:53:29,976 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:29,977 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:53:29,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:29,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:29,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:29,977 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:53:29,978 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:53:29,978 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:29,989 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:29,989 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 11:53:29,989 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:29,989 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:53:29,990 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:29,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:29,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:29,990 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:53:29,990 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:53:29,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:29,993 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:29,993 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 11:53:29,994 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:29,994 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:53:29,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:29,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:29,994 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 11:53:29,994 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:53:29,997 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 11:53:29,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:30,021 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:30,021 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 11:53:30,022 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:30,022 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:53:30,022 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:30,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:30,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:30,022 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:53:30,023 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:53:30,023 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:30,027 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:30,028 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 11:53:30,028 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:30,028 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:53:30,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:30,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:30,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:30,029 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:53:30,029 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:53:30,029 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:30,031 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:30,032 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 11:53:30,032 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:30,032 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:53:30,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:30,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:30,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:30,033 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:53:30,033 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:53:30,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:30,035 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:30,036 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 11:53:30,036 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:30,036 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:53:30,036 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:30,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:30,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:30,037 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:53:30,037 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:53:30,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:30,038 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:30,038 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 11:53:30,039 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:30,039 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:53:30,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:30,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:30,039 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:53:30,039 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:53:30,040 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:53:30,040 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:30,045 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:30,045 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 11:53:30,045 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 11:53:30,046 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:30,046 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:53:30,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:30,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:30,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:30,046 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:53:30,048 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:53:30,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:30,061 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:30,062 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 11:53:30,062 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:30,062 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:53:30,063 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:30,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:30,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:30,063 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:53:30,064 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:53:30,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:30,067 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:30,068 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 11:53:30,068 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:30,068 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:53:30,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:30,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:30,069 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 11:53:30,069 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:53:30,072 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 11:53:30,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:30,104 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:30,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 11:53:30,105 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:30,105 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:53:30,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:30,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:30,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:30,105 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:53:30,106 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:53:30,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:30,113 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:30,113 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 11:53:30,114 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:30,114 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:53:30,114 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:30,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:30,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:30,114 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:53:30,115 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:53:30,115 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:30,118 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:30,118 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 11:53:30,119 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:30,119 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:53:30,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:30,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:30,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:30,119 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:53:30,120 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:53:30,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:30,123 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:30,123 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 11:53:30,124 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:30,124 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:53:30,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:30,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:30,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:30,124 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:53:30,125 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:53:30,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:30,126 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:30,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 11:53:30,127 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:30,127 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:53:30,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:30,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:30,127 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:53:30,127 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:53:30,129 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 11:53:30,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:30,136 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:30,136 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 11:53:30,136 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 11:53:30,137 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:30,137 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:53:30,137 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:30,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:30,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:30,138 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:53:30,140 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:53:30,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:30,151 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:30,151 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 11:53:30,152 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:30,152 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:53:30,152 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:30,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:30,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:30,153 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:53:30,153 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:53:30,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:30,158 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:30,159 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 11:53:30,159 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:30,159 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:53:30,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:30,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:30,160 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 11:53:30,160 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:53:30,164 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-10 11:53:30,164 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:30,202 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:30,202 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 11:53:30,203 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:30,203 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:53:30,203 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:30,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:30,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:30,203 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:53:30,204 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:53:30,204 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:30,211 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:30,211 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 11:53:30,211 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:30,212 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:53:30,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:30,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:30,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:30,212 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:53:30,213 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:53:30,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:30,217 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:30,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:53:30,217 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:30,218 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:53:30,218 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:30,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:30,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:30,218 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:53:30,219 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:53:30,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:30,223 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:30,223 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 11:53:30,223 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:30,224 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:53:30,224 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:30,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:30,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:30,224 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:53:30,225 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:53:30,225 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:30,225 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:30,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:53:30,226 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:30,226 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:53:30,226 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:30,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:30,227 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:53:30,227 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:53:30,228 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 11:53:30,228 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:30,238 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:30,239 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 11:53:30,239 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:53:30,239 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:30,239 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:53:30,240 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:30,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:30,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:30,240 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:53:30,241 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:53:30,241 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:30,250 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:30,250 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 11:53:30,251 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:30,251 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:53:30,251 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:30,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:30,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:30,251 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:53:30,252 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:53:30,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:30,253 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:30,253 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:53:30,254 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:30,254 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:53:30,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:30,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:30,254 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 11:53:30,254 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:53:30,256 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 11:53:30,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:30,271 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:30,272 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 11:53:30,272 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:30,272 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:53:30,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:30,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:30,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:30,273 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:53:30,273 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:53:30,273 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:30,276 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:30,277 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 11:53:30,277 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:30,277 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:53:30,277 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:30,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:30,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:30,278 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:53:30,278 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:53:30,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:30,280 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:30,280 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 11:53:30,280 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:30,280 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:53:30,280 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:30,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:30,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:30,281 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:53:30,281 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:53:30,281 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:30,282 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:30,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 11:53:30,283 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:30,283 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:53:30,283 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:30,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:30,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:30,284 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:53:30,284 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:53:30,284 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:30,285 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:30,285 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 11:53:30,286 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:30,286 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:53:30,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:30,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:30,286 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:53:30,286 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:53:30,287 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 11:53:30,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:30,292 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:30,293 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 11:53:30,293 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 11:53:30,293 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:30,293 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:53:30,294 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:30,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:30,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:30,294 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:53:30,295 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:53:30,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:30,322 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:30,323 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 11:53:30,323 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:30,323 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:53:30,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:30,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:30,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:30,324 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:53:30,324 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:53:30,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:30,326 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:30,327 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 11:53:30,327 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:30,327 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:53:30,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:30,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:30,328 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 11:53:30,328 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:53:30,330 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-10 11:53:30,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:30,409 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:30,410 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 11:53:30,410 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:30,411 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:53:30,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:30,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:30,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:30,411 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:53:30,412 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:53:30,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:30,421 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:30,421 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 11:53:30,422 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:30,422 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:53:30,422 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:30,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:30,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:30,422 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:53:30,423 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:53:30,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:30,426 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:30,426 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 11:53:30,427 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:30,427 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:53:30,427 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:30,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:30,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:30,427 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:53:30,428 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:53:30,428 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:30,430 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:30,431 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 11:53:30,431 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:30,431 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:53:30,432 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:30,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:30,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:30,432 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:53:30,435 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:53:30,435 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:30,437 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:30,437 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 11:53:30,438 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:30,438 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:53:30,438 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:30,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:30,438 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:53:30,439 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:53:30,440 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 11:53:30,440 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:30,445 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:30,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:53:30,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:53:30,457 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 3 states. [2018-11-10 11:53:31,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:53:31,042 INFO L93 Difference]: Finished difference Result 381 states and 548 transitions. [2018-11-10 11:53:31,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:53:31,044 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 381 states and 548 transitions. [2018-11-10 11:53:31,048 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 372 [2018-11-10 11:53:31,054 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 381 states to 374 states and 541 transitions. [2018-11-10 11:53:31,055 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 374 [2018-11-10 11:53:31,056 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 374 [2018-11-10 11:53:31,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 374 states and 541 transitions. [2018-11-10 11:53:31,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:53:31,058 INFO L705 BuchiCegarLoop]: Abstraction has 374 states and 541 transitions. [2018-11-10 11:53:31,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states and 541 transitions. [2018-11-10 11:53:31,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2018-11-10 11:53:31,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-11-10 11:53:31,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 539 transitions. [2018-11-10 11:53:31,087 INFO L728 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-10 11:53:31,087 INFO L608 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-10 11:53:31,087 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 11:53:31,087 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 373 states and 539 transitions. [2018-11-10 11:53:31,089 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 371 [2018-11-10 11:53:31,089 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:53:31,090 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:53:31,090 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 11:53:31,090 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:53:31,090 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; 631#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; 632#L606-3 [2018-11-10 11:53:31,091 INFO L795 eck$LassoCheckResult]: Loop: 632#L606-3 assume true; 854#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 732#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; 733#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); 878#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 759#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); 694#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 695#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); 849#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 633#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; 634#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 632#L606-3 [2018-11-10 11:53:31,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:53:31,091 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-10 11:53:31,091 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:53:31,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:53:31,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:31,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:53:31,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:31,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:53:31,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:53:31,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:53:31,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1956321088, now seen corresponding path program 1 times [2018-11-10 11:53:31,097 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:53:31,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:53:31,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:31,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:53:31,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:31,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:53:31,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:53:31,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:53:31,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1962170302, now seen corresponding path program 1 times [2018-11-10 11:53:31,108 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:53:31,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:53:31,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:31,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:53:31,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:31,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:53:31,127 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 11:53:31,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:53:31,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 11:53:31,229 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:53:31,229 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:53:31,229 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:53:31,229 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:53:31,229 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 11:53:31,229 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:53:31,229 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:53:31,229 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:53:31,229 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label23_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-10 11:53:31,229 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:53:31,229 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:53:31,231 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 11:53:31,235 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 11:53:31,238 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 11:53:31,252 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 11:53:31,254 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 11:53:31,256 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 11:53:31,261 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 11:53:31,268 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 11:53:31,364 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:53:31,364 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3da76c5a-7328-4332-a477-0e7196732999/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 11:53:31,368 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:53:31,368 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:53:31,385 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:53:31,385 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_3da76c5a-7328-4332-a477-0e7196732999/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 11:53:31,389 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:53:31,389 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:53:31,399 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:53:31,399 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_3da76c5a-7328-4332-a477-0e7196732999/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 11:53:31,416 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:53:31,416 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:53:31,419 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:53:31,419 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_3da76c5a-7328-4332-a477-0e7196732999/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 11:53:31,436 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:53:31,436 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:53:31,438 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:53:31,438 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_3da76c5a-7328-4332-a477-0e7196732999/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 11:53:31,458 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:53:31,459 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:53:31,475 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:53:31,475 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_3da76c5a-7328-4332-a477-0e7196732999/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 11:53:31,480 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:53:31,480 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3da76c5a-7328-4332-a477-0e7196732999/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 11:53:31,499 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 11:53:31,499 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:53:31,530 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 11:53:31,531 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:53:31,531 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:53:31,531 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:53:31,531 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:53:31,531 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 11:53:31,531 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:53:31,531 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:53:31,532 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:53:31,532 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label23_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-10 11:53:31,532 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:53:31,532 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:53:31,533 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 11:53:31,536 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 11:53:31,543 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 11:53:31,545 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 11:53:31,547 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 11:53:31,549 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 11:53:31,552 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 11:53:31,560 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 11:53:31,644 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:53:31,645 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 11:53:31,645 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 11:53:31,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:31,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:31,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:53:31,646 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:53:31,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,647 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,648 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 11:53:31,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:31,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:31,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:53:31,648 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:53:31,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,649 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,650 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 11:53:31,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:31,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,650 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:53:31,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:53:31,650 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:53:31,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,655 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,655 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 11:53:31,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:31,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:31,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:53:31,656 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:53:31,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,656 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,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 11:53:31,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:31,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:31,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:53:31,657 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:53:31,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,658 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,658 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 11:53:31,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:31,660 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,660 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:53:31,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:53:31,660 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:53:31,661 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,662 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,662 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 11:53:31,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:31,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,662 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:53:31,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:53:31,663 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:53:31,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,664 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,665 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 11:53:31,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:31,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:31,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:53:31,666 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:53:31,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,667 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,667 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 11:53:31,668 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 11:53:31,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:31,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:31,668 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:53:31,668 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:53:31,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,669 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,670 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 11:53:31,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:31,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:31,671 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:53:31,672 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:53:31,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,673 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,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 11:53:31,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:31,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,674 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:53:31,674 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:53:31,680 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:53:31,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,681 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,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 11:53:31,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:31,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:31,682 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:53:31,682 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:53:31,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,683 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,683 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 11:53:31,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:31,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:31,683 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:53:31,684 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:53:31,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,684 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,685 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 11:53:31,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:31,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,685 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:53:31,685 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:53:31,686 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:53:31,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,688 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,688 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 11:53:31,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:31,689 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,689 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:53:31,689 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:53:31,689 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:53:31,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,692 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,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 11:53:31,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:31,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:31,693 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:53:31,693 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:53:31,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,696 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,696 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 11:53:31,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 11:53:31,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:31,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:31,697 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:53:31,697 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:53:31,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,698 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,700 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 11:53:31,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:31,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:31,700 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:53:31,701 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:53:31,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,702 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,702 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 11:53:31,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:31,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,703 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:53:31,703 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:53:31,703 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 11:53:31,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,704 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,704 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 11:53:31,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:31,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:31,705 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:53:31,705 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:53:31,705 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,705 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,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 11:53:31,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:31,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:31,707 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:53:31,707 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:53:31,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,708 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,709 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 11:53:31,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:31,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,709 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:53:31,709 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:53:31,710 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 11:53:31,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,713 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,713 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 11:53:31,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:31,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,714 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:53:31,714 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:53:31,714 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 11:53:31,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,718 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,718 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 11:53:31,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:31,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:31,723 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:53:31,723 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:53:31,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,726 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,726 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 11:53:31,726 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 11:53:31,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:31,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:31,728 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:53:31,728 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:53:31,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,729 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,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 11:53:31,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:31,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:31,731 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:53:31,731 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:53:31,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,733 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,733 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 11:53:31,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:31,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,734 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:53:31,734 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:53:31,734 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 11:53:31,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,735 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,735 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 11:53:31,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:31,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:31,736 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:53:31,736 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:53:31,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,736 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,737 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 11:53:31,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:31,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:31,737 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:53:31,737 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:53:31,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,740 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,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 11:53:31,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:31,741 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,741 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:53:31,741 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:53:31,741 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 11:53:31,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,744 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,744 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 11:53:31,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:31,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,744 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:53:31,745 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:53:31,745 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 11:53:31,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,756 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,757 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 11:53:31,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:53:31,757 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:31,758 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:53:31,758 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:53:31,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,761 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,762 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 11:53:31,762 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 11:53:31,763 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:31,763 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:53:31,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:31,763 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:53:31,764 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:53:31,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,765 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,766 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 11:53:31,766 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:31,766 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:53:31,766 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:31,767 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:53:31,767 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:53:31,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,769 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,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 11:53:31,770 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:31,770 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:53:31,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,772 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:53:31,772 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:53:31,772 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:53:31,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,774 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,774 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 11:53:31,774 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:31,775 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:53:31,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:31,775 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:53:31,775 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:53:31,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,776 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,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 11:53:31,777 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:31,777 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:53:31,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:31,777 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:53:31,778 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:53:31,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,780 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,780 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 11:53:31,780 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:31,780 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:53:31,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,781 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:53:31,781 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:53:31,781 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:53:31,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,785 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,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 11:53:31,785 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:31,785 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:53:31,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,786 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:53:31,786 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:53:31,787 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:53:31,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,792 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,793 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 11:53:31,793 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:31,793 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:53:31,793 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:31,793 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:53:31,794 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:53:31,794 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,801 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,801 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 11:53:31,801 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 11:53:31,802 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:31,802 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:53:31,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:31,802 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:53:31,803 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:53:31,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,805 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,806 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 11:53:31,806 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:31,806 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:53:31,806 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:31,807 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:53:31,807 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:53:31,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,810 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,811 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 11:53:31,811 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:31,811 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:53:31,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,811 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:53:31,811 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:53:31,812 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 11:53:31,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,813 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,813 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 11:53:31,814 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:31,814 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:53:31,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:31,814 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:53:31,815 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:53:31,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,816 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,816 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 11:53:31,816 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:31,816 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:53:31,816 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:31,817 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:53:31,817 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:53:31,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,819 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,819 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 11:53:31,820 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:31,820 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:53:31,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,820 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:53:31,820 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:53:31,821 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 11:53:31,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,827 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,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 11:53:31,827 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:31,827 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:53:31,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,828 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:53:31,828 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:53:31,830 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 11:53:31,830 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,843 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,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 11:53:31,844 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:31,844 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:53:31,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:31,845 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:53:31,846 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:53:31,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,853 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,854 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 11:53:31,854 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 11:53:31,854 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:31,854 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:53:31,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:31,855 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:53:31,856 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:53:31,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,859 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,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 11:53:31,860 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:31,860 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:53:31,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:31,861 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:53:31,862 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:53:31,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,867 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,868 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 11:53:31,868 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:31,868 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:53:31,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,869 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:53:31,869 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:53:31,870 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 11:53:31,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,872 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:53:31,872 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:31,872 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:53:31,873 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:31,873 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:53:31,874 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:53:31,874 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,883 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,883 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 11:53:31,884 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:31,884 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:53:31,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:31,884 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:53:31,885 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:53:31,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,889 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,889 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 11:53:31,889 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:31,889 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:53:31,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,890 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:53:31,890 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:53:31,895 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 11:53:31,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,902 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,902 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 11:53:31,903 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:31,903 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:53:31,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,903 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:53:31,903 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:53:31,905 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 11:53:31,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,927 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,927 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 11:53:31,928 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:31,928 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:53:31,928 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:31,928 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:53:31,930 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:53:31,930 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,937 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,938 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 11:53:31,938 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 11:53:31,938 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:31,938 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:53:31,938 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:31,939 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:53:31,939 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:53:31,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,940 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,941 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:53:31,941 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:31,941 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:53:31,941 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:31,942 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:53:31,942 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:53:31,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,946 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,946 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 11:53:31,946 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:31,947 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:53:31,947 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,947 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:53:31,947 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:53:31,947 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 11:53:31,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,949 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,949 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 11:53:31,950 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:31,950 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:53:31,950 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:31,950 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:53:31,951 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:53:31,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,952 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:53:31,953 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:31,953 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:53:31,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:31,953 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:53:31,954 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:53:31,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,959 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,960 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 11:53:31,960 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:31,960 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:53:31,960 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,961 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:53:31,961 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:53:31,961 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 11:53:31,962 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:31,965 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:31,966 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:53:31,966 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:31,966 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:53:31,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:31,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:31,966 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:53:31,966 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:53:31,967 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 11:53:31,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:32,012 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:32,013 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 11:53:32,013 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:32,013 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:53:32,013 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:32,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:32,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:32,014 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:53:32,014 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:53:32,014 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:32,025 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:32,025 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 11:53:32,026 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 11:53:32,026 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:32,026 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:53:32,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:32,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:32,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:32,027 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:53:32,027 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:53:32,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:32,029 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:32,029 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 11:53:32,030 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:32,030 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:53:32,030 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:32,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:32,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:32,030 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:53:32,031 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:53:32,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:32,037 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:32,037 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 11:53:32,037 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:32,038 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:53:32,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:32,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:32,038 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:53:32,038 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:53:32,039 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 11:53:32,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:32,040 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:32,040 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 11:53:32,041 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:32,041 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:53:32,041 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:32,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:32,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:32,041 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:53:32,041 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:53:32,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:32,043 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:32,043 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 11:53:32,044 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:32,044 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:53:32,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:32,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:32,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:32,044 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:53:32,045 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:53:32,045 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:32,047 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:32,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 11:53:32,047 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:32,047 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:53:32,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:32,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:32,048 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:53:32,048 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:53:32,049 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 11:53:32,049 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:32,055 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:32,056 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 11:53:32,056 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:32,056 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:53:32,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:32,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:32,056 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:53:32,057 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:53:32,058 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 11:53:32,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:32,078 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:32,078 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 11:53:32,079 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:53:32,079 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:53:32,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:53:32,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:53:32,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:53:32,079 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:53:32,080 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:53:32,081 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:53:32,100 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:53:32,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:53:32,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:53:32,100 INFO L87 Difference]: Start difference. First operand 373 states and 539 transitions. cyclomatic complexity: 167 Second operand 3 states. [2018-11-10 11:53:32,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:53:32,487 INFO L93 Difference]: Finished difference Result 660 states and 918 transitions. [2018-11-10 11:53:32,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:53:32,487 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 660 states and 918 transitions. [2018-11-10 11:53:32,491 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-10 11:53:32,493 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 660 states to 660 states and 918 transitions. [2018-11-10 11:53:32,493 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 660 [2018-11-10 11:53:32,494 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 660 [2018-11-10 11:53:32,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 660 states and 918 transitions. [2018-11-10 11:53:32,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:53:32,497 INFO L705 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-11-10 11:53:32,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states and 918 transitions. [2018-11-10 11:53:32,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2018-11-10 11:53:32,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2018-11-10 11:53:32,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 918 transitions. [2018-11-10 11:53:32,513 INFO L728 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-11-10 11:53:32,513 INFO L608 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-11-10 11:53:32,513 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 11:53:32,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 660 states and 918 transitions. [2018-11-10 11:53:32,516 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-10 11:53:32,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:53:32,517 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:53:32,518 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 11:53:32,518 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 11:53:32,518 INFO L793 eck$LassoCheckResult]: Stem: 1793#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; 1672#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; 1673#L606-3 [2018-11-10 11:53:32,519 INFO L795 eck$LassoCheckResult]: Loop: 1673#L606-3 assume true; 2302#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 2300#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; 1933#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); 1934#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; 2139#L606-3 assume true; 2137#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 2135#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; 2133#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); 2131#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 2129#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); 2127#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 2125#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); 2123#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 2121#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)); 2119#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); 2117#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); 2115#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); 2113#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 2111#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); 2109#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 2107#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 2052#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 2053#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); 2293#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); 2290#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 2288#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); 2286#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 2050#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 2051#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); 2066#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 2064#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); 2062#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); 2060#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 2061#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 2149#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 2054#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 2055#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); 2153#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 2154#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 2157#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 2159#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); 2161#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 2162#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 2192#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); 2165#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 2166#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); 2167#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); 2169#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 2283#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); 2281#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 2279#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 2277#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)); 2276#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); 2275#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; 2270#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1673#L606-3 [2018-11-10 11:53:32,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:53:32,520 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-10 11:53:32,520 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:53:32,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:53:32,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:32,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:53:32,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:32,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:53:32,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:53:32,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:53:32,524 INFO L82 PathProgramCache]: Analyzing trace with hash 692590236, now seen corresponding path program 1 times [2018-11-10 11:53:32,525 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:53:32,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:53:32,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:32,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:53:32,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:32,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:53:32,586 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 11:53:32,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:53:32,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 11:53:32,587 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 11:53:32,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 11:53:32,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 11:53:32,587 INFO L87 Difference]: Start difference. First operand 660 states and 918 transitions. cyclomatic complexity: 259 Second operand 4 states. [2018-11-10 11:53:33,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:53:33,186 INFO L93 Difference]: Finished difference Result 1228 states and 1701 transitions. [2018-11-10 11:53:33,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 11:53:33,187 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1228 states and 1701 transitions. [2018-11-10 11:53:33,193 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1224 [2018-11-10 11:53:33,199 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1228 states to 1228 states and 1701 transitions. [2018-11-10 11:53:33,199 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1228 [2018-11-10 11:53:33,200 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1228 [2018-11-10 11:53:33,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1228 states and 1701 transitions. [2018-11-10 11:53:33,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:53:33,203 INFO L705 BuchiCegarLoop]: Abstraction has 1228 states and 1701 transitions. [2018-11-10 11:53:33,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states and 1701 transitions. [2018-11-10 11:53:33,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1225. [2018-11-10 11:53:33,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2018-11-10 11:53:33,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1695 transitions. [2018-11-10 11:53:33,223 INFO L728 BuchiCegarLoop]: Abstraction has 1225 states and 1695 transitions. [2018-11-10 11:53:33,223 INFO L608 BuchiCegarLoop]: Abstraction has 1225 states and 1695 transitions. [2018-11-10 11:53:33,223 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 11:53:33,223 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1225 states and 1695 transitions. [2018-11-10 11:53:33,228 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1221 [2018-11-10 11:53:33,228 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:53:33,228 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:53:33,230 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 11:53:33,230 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 11:53:33,230 INFO L793 eck$LassoCheckResult]: Stem: 3691#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 11:53:33,230 INFO L795 eck$LassoCheckResult]: Loop: 3568#L606-3 assume true; 3817#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3671#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; 3672#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); 3856#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 4625#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); 4740#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 3830#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); 3831#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; 3752#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4527#L606-3 assume true; 4525#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4523#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; 4521#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; 3712#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4668#L606-3 assume true; 4667#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4665#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; 4663#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); 4661#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 4542#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); 4543#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 4755#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); 4547#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 3569#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)); 3570#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); 4425#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); 4422#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); 4418#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 4413#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); 4409#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 4405#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 4400#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 4395#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); 4390#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); 4385#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 4379#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); 4372#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 4367#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 4362#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); 4358#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 4354#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); 4350#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); 4345#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 4340#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 4335#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 4332#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 4331#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); 4330#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 4329#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 4328#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 4327#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); 4325#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 4323#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 4321#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); 4319#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 4317#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); 4315#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); 4314#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 4312#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); 4310#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 4308#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 4306#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)); 4304#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); 4302#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; 3716#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 11:53:33,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:53:33,231 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-10 11:53:33,231 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:53:33,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:53:33,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:33,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:53:33,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:33,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:53:33,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:53:33,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:53:33,236 INFO L82 PathProgramCache]: Analyzing trace with hash 676565178, now seen corresponding path program 1 times [2018-11-10 11:53:33,236 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:53:33,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:53:33,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:33,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:53:33,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:33,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:53:33,257 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 11:53:33,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:53:33,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:53:33,258 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 11:53:33,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:53:33,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:53:33,258 INFO L87 Difference]: Start difference. First operand 1225 states and 1695 transitions. cyclomatic complexity: 472 Second operand 3 states. [2018-11-10 11:53:33,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:53:33,676 INFO L93 Difference]: Finished difference Result 1509 states and 2004 transitions. [2018-11-10 11:53:33,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:53:33,677 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1509 states and 2004 transitions. [2018-11-10 11:53:33,684 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1505 [2018-11-10 11:53:33,690 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1509 states to 1509 states and 2004 transitions. [2018-11-10 11:53:33,690 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1509 [2018-11-10 11:53:33,691 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1509 [2018-11-10 11:53:33,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1509 states and 2004 transitions. [2018-11-10 11:53:33,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:53:33,693 INFO L705 BuchiCegarLoop]: Abstraction has 1509 states and 2004 transitions. [2018-11-10 11:53:33,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states and 2004 transitions. [2018-11-10 11:53:33,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1508. [2018-11-10 11:53:33,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1508 states. [2018-11-10 11:53:33,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 2002 transitions. [2018-11-10 11:53:33,712 INFO L728 BuchiCegarLoop]: Abstraction has 1508 states and 2002 transitions. [2018-11-10 11:53:33,712 INFO L608 BuchiCegarLoop]: Abstraction has 1508 states and 2002 transitions. [2018-11-10 11:53:33,712 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 11:53:33,712 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1508 states and 2002 transitions. [2018-11-10 11:53:33,718 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-10 11:53:33,718 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:53:33,718 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:53:33,719 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 11:53:33,719 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 11:53:33,719 INFO L793 eck$LassoCheckResult]: Stem: 6431#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 11:53:33,719 INFO L795 eck$LassoCheckResult]: Loop: 6308#L606-3 assume true; 7631#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7626#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; 7621#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); 7616#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 7611#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); 7606#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 7601#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); 7549#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 7544#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)); 7541#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); 7537#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); 7533#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); 7529#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 7526#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); 7523#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 7520#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 7518#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 7250#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; 7244#L606-3 assume true; 7242#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7240#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; 7238#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; 6531#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 7245#L606-3 assume true; 7243#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7241#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; 7239#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); 7237#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 7235#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); 7233#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 7231#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); 7229#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 7227#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)); 7225#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); 7223#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); 7221#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); 7219#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 7217#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); 7216#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 7214#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 7212#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 7210#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); 7208#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); 7206#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 7204#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); 7202#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 7200#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 7198#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); 7196#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 7194#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); 7192#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); 7190#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 7188#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 7186#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 7184#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 7182#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); 7180#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 7178#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 7176#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 7174#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); 7172#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 7170#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 7168#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); 7166#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 7164#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); 7162#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); 7160#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 7158#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); 7156#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 7154#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 7152#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)); 7150#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); 7148#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; 7147#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 11:53:33,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:53:33,720 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-10 11:53:33,720 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:53:33,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:53:33,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:33,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:53:33,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:33,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:53:33,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:53:33,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:53:33,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1219893882, now seen corresponding path program 1 times [2018-11-10 11:53:33,724 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:53:33,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:53:33,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:33,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:53:33,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:53:33,759 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 11:53:33,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:53:33,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:53:33,759 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 11:53:33,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:53:33,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:53:33,760 INFO L87 Difference]: Start difference. First operand 1508 states and 2002 transitions. cyclomatic complexity: 496 Second operand 3 states. [2018-11-10 11:53:34,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:53:34,192 INFO L93 Difference]: Finished difference Result 1507 states and 1823 transitions. [2018-11-10 11:53:34,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:53:34,194 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1507 states and 1823 transitions. [2018-11-10 11:53:34,201 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-10 11:53:34,206 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1507 states to 1507 states and 1823 transitions. [2018-11-10 11:53:34,207 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1507 [2018-11-10 11:53:34,209 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1507 [2018-11-10 11:53:34,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1507 states and 1823 transitions. [2018-11-10 11:53:34,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:53:34,211 INFO L705 BuchiCegarLoop]: Abstraction has 1507 states and 1823 transitions. [2018-11-10 11:53:34,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states and 1823 transitions. [2018-11-10 11:53:34,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1507. [2018-11-10 11:53:34,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2018-11-10 11:53:34,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1823 transitions. [2018-11-10 11:53:34,229 INFO L728 BuchiCegarLoop]: Abstraction has 1507 states and 1823 transitions. [2018-11-10 11:53:34,229 INFO L608 BuchiCegarLoop]: Abstraction has 1507 states and 1823 transitions. [2018-11-10 11:53:34,229 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 11:53:34,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1507 states and 1823 transitions. [2018-11-10 11:53:34,235 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-10 11:53:34,235 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:53:34,235 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:53:34,236 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 11:53:34,236 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 11:53:34,237 INFO L793 eck$LassoCheckResult]: Stem: 9447#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 11:53:34,237 INFO L795 eck$LassoCheckResult]: Loop: 9329#L606-3 assume true; 10113#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 10111#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; 10109#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); 10107#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 10105#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); 10103#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 10101#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); 10099#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 10097#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)); 10095#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); 10093#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); 10090#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); 10088#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 10087#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); 10086#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 10085#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 10083#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 9896#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); 9897#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); 10137#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 10136#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); 10134#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 10132#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 10130#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); 10128#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 10126#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); 10124#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); 10122#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 9774#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; 9665#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9767#L606-3 assume true; 9765#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 9763#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; 9761#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); 9759#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 9757#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); 9755#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 9753#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); 9751#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 9749#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)); 9747#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); 9745#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); 9743#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); 9741#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 9739#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); 9737#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 9735#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 9733#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 9731#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); 9729#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); 9727#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 9725#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); 9723#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 9721#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 9719#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); 9717#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 9715#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); 9712#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); 9710#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 9708#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 9706#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 9704#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 9702#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); 9700#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 9698#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 9696#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 9694#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); 9692#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 9690#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 9688#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); 9686#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 9684#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); 9682#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); 9680#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 9678#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); 9676#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 9674#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 9672#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)); 9670#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); 9667#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; 9668#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 11:53:34,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:53:34,237 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-10 11:53:34,237 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:53:34,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:53:34,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:34,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:53:34,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:34,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:53:34,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:53:34,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:53:34,241 INFO L82 PathProgramCache]: Analyzing trace with hash -606648447, now seen corresponding path program 1 times [2018-11-10 11:53:34,241 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:53:34,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:53:34,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:34,242 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:53:34,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:34,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:53:34,292 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 11:53:34,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:53:34,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:53:34,293 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 11:53:34,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:53:34,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:53:34,293 INFO L87 Difference]: Start difference. First operand 1507 states and 1823 transitions. cyclomatic complexity: 318 Second operand 3 states. [2018-11-10 11:53:34,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:53:34,546 INFO L93 Difference]: Finished difference Result 1496 states and 1779 transitions. [2018-11-10 11:53:34,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:53:34,547 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1496 states and 1779 transitions. [2018-11-10 11:53:34,554 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-10 11:53:34,560 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1496 states to 1496 states and 1779 transitions. [2018-11-10 11:53:34,560 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1496 [2018-11-10 11:53:34,562 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1496 [2018-11-10 11:53:34,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1496 states and 1779 transitions. [2018-11-10 11:53:34,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:53:34,564 INFO L705 BuchiCegarLoop]: Abstraction has 1496 states and 1779 transitions. [2018-11-10 11:53:34,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states and 1779 transitions. [2018-11-10 11:53:34,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1496. [2018-11-10 11:53:34,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2018-11-10 11:53:34,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 1779 transitions. [2018-11-10 11:53:34,584 INFO L728 BuchiCegarLoop]: Abstraction has 1496 states and 1779 transitions. [2018-11-10 11:53:34,584 INFO L608 BuchiCegarLoop]: Abstraction has 1496 states and 1779 transitions. [2018-11-10 11:53:34,584 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 11:53:34,584 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1496 states and 1779 transitions. [2018-11-10 11:53:34,589 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-10 11:53:34,590 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:53:34,590 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:53:34,590 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 11:53:34,590 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 11:53:34,591 INFO L793 eck$LassoCheckResult]: Stem: 12457#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 11:53:34,592 INFO L795 eck$LassoCheckResult]: Loop: 12338#L606-3 assume true; 13073#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 13071#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; 13069#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); 13063#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 13064#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); 13340#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 13338#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); 13336#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 13333#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)); 13332#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); 13331#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); 13330#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); 13329#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 13328#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); 13326#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 13324#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 13322#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 13320#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); 13318#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); 13316#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 13314#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); 13312#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 13310#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 13308#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); 13306#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13304#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); 13302#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); 13300#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 13298#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 13296#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 13294#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 13292#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); 13290#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 13288#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 13286#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 13284#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); 13282#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 13280#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 13278#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); 13276#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 13274#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); 13272#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); 13270#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 13268#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); 13266#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 13264#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 13262#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)); 13260#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); 13258#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); 13256#L259 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && (((~a28~0 == 9 && calculate_output_~input == 6) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a25~0 == 1)); 13254#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); 13252#L276 assume !(~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && ~a21~0 == 1 && ~a19~0 == 1 && calculate_output_~input == 5 && !(~a11~0 == 1)); 13250#L280 assume !(~a28~0 == 8 && ~a21~0 == 1 && (!(~a11~0 == 1) && (calculate_output_~input == 1 && ~a17~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 13248#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); 13246#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); 13244#L291 assume !(~a17~0 == 8 && (~a21~0 == 1 && !(~a11~0 == 1) && ~a25~0 == 1 && ~a28~0 == 8 && calculate_output_~input == 6) && ~a19~0 == 1); 13242#L293 assume !((~a19~0 == 1 && ~a17~0 == 8 && ((!(~a25~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11); 13240#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); 13238#L309 assume !((((((calculate_output_~input == 3 && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a28~0 == 11) && !(~a11~0 == 1)); 13236#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); 13234#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); 13232#L331 assume !((!(~a11~0 == 1) && (((calculate_output_~input == 4 && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1); 13230#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)); 13228#L349 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && ((~a25~0 == 1 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 11) && ~a21~0 == 1); 13226#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); 13224#L361 assume !(~a19~0 == 1 && ((~a21~0 == 1 && (!(~a25~0 == 1) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a28~0 == 8) && ~a11~0 == 1); 13222#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)); 13220#L375 assume !(~a19~0 == 1 && (((~a17~0 == 8 && calculate_output_~input == 5 && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a25~0 == 1) && ~a28~0 == 8); 13218#L378 assume !(((!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 4) && ~a28~0 == 10) && ~a17~0 == 8) && !(~a19~0 == 1)) && ~a25~0 == 1); 13216#L380 assume !(~a28~0 == 8 && (~a19~0 == 1 && ~a11~0 == 1 && !(~a25~0 == 1) && ~a17~0 == 9 && calculate_output_~input == 6) && ~a21~0 == 1); 13214#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)); 13212#L394 assume !(((((!(~a25~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 9) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 13210#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)); 13208#L402 assume !(((!(~a11~0 == 1) && ((~a19~0 == 1 && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)); 13206#L404 assume !((~a11~0 == 1 && ~a19~0 == 1 && ~a21~0 == 1 && (~a17~0 == 9 && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a28~0 == 8); 13204#L407 assume !(!(~a11~0 == 1) && ~a21~0 == 1 && (~a19~0 == 1 && ~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 5) && ~a28~0 == 11); 13202#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); 13200#L414 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13198#L414-2 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13196#L417-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13194#L420-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13192#L423-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13190#L426-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13188#L429-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13186#L432-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13184#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); 13181#L441-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13179#L444-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13177#L447-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13175#L450-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13173#L453-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13171#L456-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13169#L459-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13167#L462-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13165#L465-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13162#L468-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13160#L471-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13158#L474-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13156#L477-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13154#L480-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13152#L483-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13150#L486-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13148#L489-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13146#L492-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13144#L495-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13142#L498-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13140#L501-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13138#L504-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13136#L507-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13134#L510-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13132#L513-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13129#L516-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13127#L519-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13125#L522-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13123#L525-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13121#L528-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13119#L531-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13117#L534-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13115#L537-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13113#L540-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13111#L543-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13109#L546-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13107#L549-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13105#L552-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13104#L555-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13102#L558-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13100#L561-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13098#L564-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13096#L567-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13094#L570-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13092#L573-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13090#L576-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13088#L579-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13086#L582-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13084#L585-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13082#L588-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13080#L591-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13078#L594-1 calculate_output_#res := -2; 13076#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 11:53:34,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:53:34,592 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-10 11:53:34,592 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:53:34,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:53:34,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:34,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:53:34,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:34,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:53:34,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:53:34,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:53:34,598 INFO L82 PathProgramCache]: Analyzing trace with hash 245249823, now seen corresponding path program 1 times [2018-11-10 11:53:34,598 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:53:34,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:53:34,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:34,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:53:34,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:34,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:53:34,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:53:34,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:53:34,641 INFO L82 PathProgramCache]: Analyzing trace with hash -2003304803, now seen corresponding path program 1 times [2018-11-10 11:53:34,641 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:53:34,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:53:34,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:34,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:53:34,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:34,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:53:35,085 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 11:53:35,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:53:35,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 11:53:35,748 WARN L179 SmtUtils]: Spent 647.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2018-11-10 11:53:35,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 11:53:35,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-10 11:53:35,821 INFO L87 Difference]: Start difference. First operand 1496 states and 1779 transitions. cyclomatic complexity: 286 Second operand 10 states. [2018-11-10 11:53:36,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:53:36,542 INFO L93 Difference]: Finished difference Result 1688 states and 1968 transitions. [2018-11-10 11:53:36,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 11:53:36,542 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1688 states and 1968 transitions. [2018-11-10 11:53:36,547 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1632 [2018-11-10 11:53:36,553 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1688 states to 1688 states and 1968 transitions. [2018-11-10 11:53:36,554 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1688 [2018-11-10 11:53:36,555 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1688 [2018-11-10 11:53:36,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1688 states and 1968 transitions. [2018-11-10 11:53:36,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:53:36,557 INFO L705 BuchiCegarLoop]: Abstraction has 1688 states and 1968 transitions. [2018-11-10 11:53:36,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states and 1968 transitions. [2018-11-10 11:53:36,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1546. [2018-11-10 11:53:36,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2018-11-10 11:53:36,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 1826 transitions. [2018-11-10 11:53:36,576 INFO L728 BuchiCegarLoop]: Abstraction has 1546 states and 1826 transitions. [2018-11-10 11:53:36,576 INFO L608 BuchiCegarLoop]: Abstraction has 1546 states and 1826 transitions. [2018-11-10 11:53:36,577 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 11:53:36,577 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1546 states and 1826 transitions. [2018-11-10 11:53:36,582 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1490 [2018-11-10 11:53:36,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:53:36,582 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:53:36,582 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:53:36,582 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:53:36,583 INFO L793 eck$LassoCheckResult]: Stem: 15661#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; 16760#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16758#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; 16756#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); 16754#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; 15805#L597 [2018-11-10 11:53:36,583 INFO L795 eck$LassoCheckResult]: Loop: 15805#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 16282#L606-3 assume true; 16280#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16278#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; 16276#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); 16274#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 16272#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); 16270#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 16268#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; 15805#L597 [2018-11-10 11:53:36,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:53:36,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1805984299, now seen corresponding path program 1 times [2018-11-10 11:53:36,583 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:53:36,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:53:36,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:36,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:53:36,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:36,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:53:36,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:53:36,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:53:36,589 INFO L82 PathProgramCache]: Analyzing trace with hash -278812021, now seen corresponding path program 1 times [2018-11-10 11:53:36,590 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:53:36,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:53:36,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:36,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:53:36,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:36,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:53:36,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:53:36,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:53:36,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1569761375, now seen corresponding path program 1 times [2018-11-10 11:53:36,595 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:53:36,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:53:36,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:36,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:53:36,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:36,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:53:36,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:53:36,754 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:53:36,754 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:53:36,755 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:53:36,755 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:53:36,755 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 11:53:36,755 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:53:36,755 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:53:36,755 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:53:36,755 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label23_true-unreach-call_false-termination.c_Iteration8_Lasso [2018-11-10 11:53:36,755 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:53:36,755 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:53:36,757 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 11:53:36,762 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 11:53:36,764 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 11:53:36,764 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 11:53:36,766 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 11:53:36,767 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 11:53:36,769 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 11:53:36,770 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 11:53:36,772 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 11:53:36,773 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 11:53:36,774 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 11:53:36,776 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 11:53:36,777 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 11:53:36,778 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 11:53:36,780 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 11:53:36,781 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 11:53:36,787 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 11:53:36,789 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 11:53:36,794 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 11:53:36,796 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 11:53:36,798 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 11:53:36,914 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:53:36,914 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3da76c5a-7328-4332-a477-0e7196732999/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 11:53:36,919 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:53:36,919 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:53:36,921 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:53:36,922 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_3da76c5a-7328-4332-a477-0e7196732999/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 11:53:36,939 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:53:36,939 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:53:36,955 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:53:36,955 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_3da76c5a-7328-4332-a477-0e7196732999/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 11:53:36,961 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:53:36,962 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:53:36,964 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:53:36,964 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_3da76c5a-7328-4332-a477-0e7196732999/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 11:53:36,981 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:53:36,981 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:53:36,983 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:53:36,983 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_3da76c5a-7328-4332-a477-0e7196732999/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 11:53:37,000 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:53:37,000 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:53:37,002 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:53:37,002 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_3da76c5a-7328-4332-a477-0e7196732999/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 11:53:37,019 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:53:37,019 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:53:37,035 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:53:37,035 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_3da76c5a-7328-4332-a477-0e7196732999/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 11:53:37,039 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:53:37,040 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:53:37,042 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:53:37,042 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_3da76c5a-7328-4332-a477-0e7196732999/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 11:53:37,059 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:53:37,059 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:53:37,075 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:53:37,075 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_3da76c5a-7328-4332-a477-0e7196732999/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 11:53:37,084 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:53:37,084 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:53:37,101 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:53:37,101 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_3da76c5a-7328-4332-a477-0e7196732999/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 11:53:37,104 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:53:37,104 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:53:37,106 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:53:37,106 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_3da76c5a-7328-4332-a477-0e7196732999/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 11:53:37,123 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:53:37,123 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:53:37,139 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:53:37,139 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_3da76c5a-7328-4332-a477-0e7196732999/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 11:53:37,142 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:53:37,142 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:53:37,158 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:53:37,158 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_3da76c5a-7328-4332-a477-0e7196732999/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 11:53:37,161 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:53:37,161 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:53:37,164 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:53:37,164 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_3da76c5a-7328-4332-a477-0e7196732999/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 11:53:37,181 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:53:37,181 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:53:37,183 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:53:37,183 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_3da76c5a-7328-4332-a477-0e7196732999/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 11:53:37,200 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:53:37,200 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:53:37,216 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:53:37,216 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_3da76c5a-7328-4332-a477-0e7196732999/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 11:53:37,219 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:53:37,219 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3da76c5a-7328-4332-a477-0e7196732999/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 11:53:37,239 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 11:53:37,239 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:53:37,440 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:53:37,440 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_3da76c5a-7328-4332-a477-0e7196732999/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 11:53:37,456 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:53:37,456 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:53:37,459 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:53:37,459 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_3da76c5a-7328-4332-a477-0e7196732999/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 11:53:37,475 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:53:37,475 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3da76c5a-7328-4332-a477-0e7196732999/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 11:53:37,494 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 11:53:37,494 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:53:37,644 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:53:37,644 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_3da76c5a-7328-4332-a477-0e7196732999/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 11:53:37,659 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:53:37,659 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:53:37,675 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:53:37,676 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_3da76c5a-7328-4332-a477-0e7196732999/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 11:53:37,679 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:53:37,679 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:53:37,681 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:53:37,681 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_3da76c5a-7328-4332-a477-0e7196732999/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 11:53:37,697 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:53:37,697 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:53:37,700 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:53:37,700 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 11:53:37,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 11:53:37 BoogieIcfgContainer [2018-11-10 11:53:37,747 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 11:53:37,747 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 11:53:37,747 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 11:53:37,747 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 11:53:37,750 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:53:28" (3/4) ... [2018-11-10 11:53:37,753 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-10 11:53:37,785 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3da76c5a-7328-4332-a477-0e7196732999/bin-2019/uautomizer/witness.graphml [2018-11-10 11:53:37,786 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 11:53:37,786 INFO L168 Benchmark]: Toolchain (without parser) took 10603.87 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 455.1 MB). Free memory was 958.0 MB in the beginning and 822.5 MB in the end (delta: 135.6 MB). Peak memory consumption was 590.6 MB. Max. memory is 11.5 GB. [2018-11-10 11:53:37,787 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:53:37,787 INFO L168 Benchmark]: CACSL2BoogieTranslator took 364.96 ms. Allocated memory is still 1.0 GB. Free memory was 958.0 MB in the beginning and 925.8 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2018-11-10 11:53:37,787 INFO L168 Benchmark]: Boogie Procedure Inliner took 107.17 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 925.8 MB in the beginning and 1.1 GB in the end (delta: -178.7 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-11-10 11:53:37,788 INFO L168 Benchmark]: Boogie Preprocessor took 42.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-10 11:53:37,788 INFO L168 Benchmark]: RCFGBuilder took 814.62 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 994.0 MB in the end (delta: 105.1 MB). Peak memory consumption was 105.1 MB. Max. memory is 11.5 GB. [2018-11-10 11:53:37,788 INFO L168 Benchmark]: BuchiAutomizer took 9232.33 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 343.4 MB). Free memory was 994.0 MB in the beginning and 822.5 MB in the end (delta: 171.6 MB). Peak memory consumption was 515.0 MB. Max. memory is 11.5 GB. [2018-11-10 11:53:37,789 INFO L168 Benchmark]: Witness Printer took 38.54 ms. Allocated memory is still 1.5 GB. Free memory is still 822.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:53:37,790 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 364.96 ms. Allocated memory is still 1.0 GB. Free memory was 958.0 MB in the beginning and 925.8 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 107.17 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 925.8 MB in the beginning and 1.1 GB in the end (delta: -178.7 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 814.62 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 994.0 MB in the end (delta: 105.1 MB). Peak memory consumption was 105.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9232.33 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 343.4 MB). Free memory was 994.0 MB in the beginning and 822.5 MB in the end (delta: 171.6 MB). Peak memory consumption was 515.0 MB. Max. memory is 11.5 GB. * Witness Printer took 38.54 ms. Allocated memory is still 1.5 GB. Free memory is still 822.5 MB. 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.9s. 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: 1468 SDtfs, 3083 SDslu, 488 SDs, 0 SdLazy, 3702 SolverSat, 849 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: 82ms 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@739718d9=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4443e941=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@739718d9=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4443e941=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@739718d9=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@4443e941=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...