./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label41_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_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label41_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/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 43cbcba3b52a19a4f3b50b9a2bc823d03105b297 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 13:19:59,534 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 13:19:59,535 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 13:19:59,543 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 13:19:59,543 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 13:19:59,544 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 13:19:59,544 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 13:19:59,545 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 13:19:59,546 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 13:19:59,546 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 13:19:59,547 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 13:19:59,547 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 13:19:59,548 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 13:19:59,548 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 13:19:59,549 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 13:19:59,550 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 13:19:59,550 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 13:19:59,551 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 13:19:59,553 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 13:19:59,554 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 13:19:59,554 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 13:19:59,555 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 13:19:59,556 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 13:19:59,556 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 13:19:59,556 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 13:19:59,557 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 13:19:59,557 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 13:19:59,558 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 13:19:59,558 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 13:19:59,559 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 13:19:59,559 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 13:19:59,560 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 13:19:59,560 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 13:19:59,560 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 13:19:59,561 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 13:19:59,561 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 13:19:59,561 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 13:19:59,569 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 13:19:59,569 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 13:19:59,570 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 13:19:59,570 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 13:19:59,570 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 13:19:59,570 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 13:19:59,570 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 13:19:59,571 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 13:19:59,571 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 13:19:59,571 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 13:19:59,571 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 13:19:59,571 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 13:19:59,571 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 13:19:59,571 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 13:19:59,572 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 13:19:59,572 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 13:19:59,572 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 13:19:59,572 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 13:19:59,572 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 13:19:59,572 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 13:19:59,572 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 13:19:59,573 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 13:19:59,573 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 13:19:59,573 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 13:19:59,573 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 13:19:59,573 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 13:19:59,573 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 13:19:59,573 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 13:19:59,573 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 13:19:59,574 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 13:19:59,574 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 13:19:59,574 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_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/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 -> 43cbcba3b52a19a4f3b50b9a2bc823d03105b297 [2018-11-10 13:19:59,597 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 13:19:59,605 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 13:19:59,607 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 13:19:59,608 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 13:19:59,608 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 13:19:59,608 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label41_true-unreach-call_false-termination.c [2018-11-10 13:19:59,643 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/bin-2019/uautomizer/data/5cbcaf8d2/880d52f90d4942e7b9ad4a82c5f31e78/FLAG9bfa02677 [2018-11-10 13:19:59,987 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 13:19:59,987 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/sv-benchmarks/c/eca-rers2012/Problem02_label41_true-unreach-call_false-termination.c [2018-11-10 13:19:59,996 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/bin-2019/uautomizer/data/5cbcaf8d2/880d52f90d4942e7b9ad4a82c5f31e78/FLAG9bfa02677 [2018-11-10 13:20:00,007 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/bin-2019/uautomizer/data/5cbcaf8d2/880d52f90d4942e7b9ad4a82c5f31e78 [2018-11-10 13:20:00,009 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 13:20:00,011 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 13:20:00,011 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 13:20:00,011 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 13:20:00,014 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 13:20:00,015 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:20:00" (1/1) ... [2018-11-10 13:20:00,016 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50020d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:20:00, skipping insertion in model container [2018-11-10 13:20:00,016 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:20:00" (1/1) ... [2018-11-10 13:20:00,022 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 13:20:00,054 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 13:20:00,292 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:20:00,295 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 13:20:00,360 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:20:00,369 INFO L193 MainTranslator]: Completed translation [2018-11-10 13:20:00,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:20:00 WrapperNode [2018-11-10 13:20:00,369 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 13:20:00,370 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 13:20:00,370 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 13:20:00,370 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 13:20:00,375 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:20:00" (1/1) ... [2018-11-10 13:20:00,387 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:20:00" (1/1) ... [2018-11-10 13:20:00,471 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 13:20:00,471 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 13:20:00,471 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 13:20:00,471 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 13:20:00,477 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:20:00" (1/1) ... [2018-11-10 13:20:00,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:20:00" (1/1) ... [2018-11-10 13:20:00,481 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:20:00" (1/1) ... [2018-11-10 13:20:00,481 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:20:00" (1/1) ... [2018-11-10 13:20:00,494 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:20:00" (1/1) ... [2018-11-10 13:20:00,502 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:20:00" (1/1) ... [2018-11-10 13:20:00,506 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:20:00" (1/1) ... [2018-11-10 13:20:00,511 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 13:20:00,512 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 13:20:00,512 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 13:20:00,512 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 13:20:00,512 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:20:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/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 13:20:00,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 13:20:00,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 13:20:01,487 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 13:20:01,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:20:01 BoogieIcfgContainer [2018-11-10 13:20:01,488 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 13:20:01,488 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 13:20:01,488 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 13:20:01,492 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 13:20:01,492 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 13:20:01,493 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 01:20:00" (1/3) ... [2018-11-10 13:20:01,493 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b583872 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 01:20:01, skipping insertion in model container [2018-11-10 13:20:01,493 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 13:20:01,494 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:20:00" (2/3) ... [2018-11-10 13:20:01,495 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b583872 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 01:20:01, skipping insertion in model container [2018-11-10 13:20:01,495 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 13:20:01,495 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:20:01" (3/3) ... [2018-11-10 13:20:01,496 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label41_true-unreach-call_false-termination.c [2018-11-10 13:20:01,528 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 13:20:01,529 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 13:20:01,529 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 13:20:01,529 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 13:20:01,529 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 13:20:01,529 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 13:20:01,529 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 13:20:01,529 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 13:20:01,530 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 13:20:01,543 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-10 13:20:01,566 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-10 13:20:01,567 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:20:01,567 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:20:01,574 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 13:20:01,574 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 13:20:01,574 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 13:20:01,574 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-10 13:20:01,580 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-10 13:20:01,581 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:20:01,581 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:20:01,582 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 13:20:01,582 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 13:20:01,587 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 13:20:01,588 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 13:20:01,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:20:01,592 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 13:20:01,593 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:20:01,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:20:01,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:20:01,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:20:01,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:20:01,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:20:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:20:01,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:20:01,664 INFO L82 PathProgramCache]: Analyzing trace with hash 34545679, now seen corresponding path program 1 times [2018-11-10 13:20:01,664 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:20:01,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:20:01,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:20:01,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:20:01,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:20:01,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:20:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:20:01,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:20:01,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1805985165, now seen corresponding path program 1 times [2018-11-10 13:20:01,686 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:20:01,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:20:01,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:20:01,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:20:01,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:20:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:01,763 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 13:20:01,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:20:01,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 13:20:01,875 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 13:20:01,876 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 13:20:01,876 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 13:20:01,876 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 13:20:01,876 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 13:20:01,876 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:20:01,876 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 13:20:01,877 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 13:20:01,877 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label41_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-10 13:20:01,877 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 13:20:01,877 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 13:20:01,894 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 13:20:01,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:20:01,922 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 13:20:01,924 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 13:20:01,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:20:01,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:20:01,932 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 13:20:01,938 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 13:20:02,107 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 13:20:02,108 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/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 13:20:02,127 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:20:02,127 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:20:02,161 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 13:20:02,161 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_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/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 13:20:02,177 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:20:02,177 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:20:02,183 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 13:20:02,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_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/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 13:20:02,209 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:20:02,209 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:20:02,239 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 13:20:02,239 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_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/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 13:20:02,253 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:20:02,253 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:20:02,259 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 13:20:02,259 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_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:20:02,276 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:20:02,276 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:20:02,303 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 13:20:02,303 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_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/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 13:20:02,319 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:20:02,319 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:20:02,321 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 13:20:02,321 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_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/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 13:20:02,346 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:20:02,346 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:20:02,351 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 13:20:02,351 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_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/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 13:20:02,378 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:20:02,378 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/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 13:20:02,400 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 13:20:02,400 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:20:02,436 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 13:20:02,437 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 13:20:02,438 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 13:20:02,438 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 13:20:02,438 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 13:20:02,438 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 13:20:02,438 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:20:02,438 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 13:20:02,438 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 13:20:02,438 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label41_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-10 13:20:02,439 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 13:20:02,439 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 13:20:02,441 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 13:20:02,451 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 13:20:02,454 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 13:20:02,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 13:20:02,508 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 13:20:02,518 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 13:20:02,527 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 13:20:02,528 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 13:20:02,765 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 13:20:02,770 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 13:20:02,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:02,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:02,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:02,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:02,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:02,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:20:02,776 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:20:02,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:02,784 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:02,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:02,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:02,784 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:02,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:02,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:02,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:20:02,785 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:20:02,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:02,789 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:02,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:02,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:02,790 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:02,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:02,790 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 13:20:02,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:20:02,791 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:20:02,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:02,805 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:02,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 13:20:02,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:02,806 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:02,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:02,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:02,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:20:02,807 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:20:02,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:02,809 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:02,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:02,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:02,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:02,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:02,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:02,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:20:02,811 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:20:02,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:02,813 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:02,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 13:20:02,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:02,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:02,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:02,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:02,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:20:02,815 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:20:02,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:02,816 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:02,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:02,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:02,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:02,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:02,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:02,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:20:02,818 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:20:02,818 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:02,819 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:02,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 13:20:02,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:02,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:02,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:02,820 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 13:20:02,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:20:02,820 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 13:20:02,820 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:02,827 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:02,827 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 13:20:02,828 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:02,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:02,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:02,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:02,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:02,829 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 13:20:02,829 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 13:20:02,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:02,837 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:02,837 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:02,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:02,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:02,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:02,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:02,838 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 13:20:02,840 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 13:20:02,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:02,842 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:02,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:02,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:02,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:02,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:02,843 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 13:20:02,843 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 13:20:02,846 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 13:20:02,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:02,857 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:02,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:02,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:02,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:02,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:02,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:02,859 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 13:20:02,859 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 13:20:02,859 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:02,862 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:02,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:02,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:02,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:02,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:02,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:02,865 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 13:20:02,866 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 13:20:02,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:02,867 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:02,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 13:20:02,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:02,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:02,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:02,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:02,868 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 13:20:02,869 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 13:20:02,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:02,870 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:02,870 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:02,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:02,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:02,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:02,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:02,871 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 13:20:02,871 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 13:20:02,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:02,872 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:02,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 13:20:02,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:02,873 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:02,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:02,873 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 13:20:02,873 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 13:20:02,873 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:20:02,874 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:02,881 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:02,881 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 13:20:02,881 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:02,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:02,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:02,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:02,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:02,882 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 13:20:02,885 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 13:20:02,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:02,889 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:02,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 13:20:02,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:02,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:02,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:02,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:02,890 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 13:20:02,890 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 13:20:02,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:02,892 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:02,892 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:02,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:02,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:02,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:02,893 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 13:20:02,893 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 13:20:02,894 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 13:20:02,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:02,903 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:02,903 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:02,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:02,904 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:02,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:02,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:02,904 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 13:20:02,905 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 13:20:02,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:02,907 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:02,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:02,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:02,908 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:02,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:02,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:02,908 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 13:20:02,908 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 13:20:02,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:02,909 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:02,910 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:02,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:02,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:02,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:02,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:02,914 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 13:20:02,914 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 13:20:02,914 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:02,915 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:02,916 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:02,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:02,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:02,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:02,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:02,917 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 13:20:02,917 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 13:20:02,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:02,917 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:02,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:02,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:02,918 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:02,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:02,918 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 13:20:02,918 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 13:20:02,919 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 13:20:02,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:02,922 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:02,922 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 13:20:02,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 13:20:02,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:02,924 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:02,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:02,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:02,924 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 13:20:02,925 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 13:20:02,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:02,929 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:02,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:02,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:02,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:02,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:02,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:02,930 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 13:20:02,931 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 13:20:02,931 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:02,933 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:02,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 13:20:02,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:02,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:02,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:02,934 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 13:20:02,934 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 13:20:02,935 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-10 13:20:02,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:02,945 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:02,945 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:02,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:02,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:02,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:02,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:02,946 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 13:20:02,947 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 13:20:02,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:02,949 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:02,950 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:02,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:02,950 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:02,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:02,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:02,950 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 13:20:02,951 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 13:20:02,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:02,952 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:02,953 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:02,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:02,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:02,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:02,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:02,953 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 13:20:02,954 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 13:20:02,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:02,955 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:02,956 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:02,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:02,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:02,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:02,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:02,956 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 13:20:02,957 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 13:20:02,957 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:02,957 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:02,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 13:20:02,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:02,963 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:02,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:02,963 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 13:20:02,963 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 13:20:02,964 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 13:20:02,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:02,970 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:02,970 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 13:20:02,971 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:02,971 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:02,971 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 13:20:02,971 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:02,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:02,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:02,972 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 13:20:02,973 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 13:20:02,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:02,983 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:02,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:02,984 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:02,984 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 13:20:02,984 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:02,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:02,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:02,985 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 13:20:02,985 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 13:20:02,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:02,987 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:02,988 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:02,988 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:02,988 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 13:20:02,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:02,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:02,988 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 13:20:02,989 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 13:20:02,990 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 13:20:02,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:03,013 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:03,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:03,014 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:03,016 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 13:20:03,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:03,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:03,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:03,016 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 13:20:03,017 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 13:20:03,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:03,020 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:03,020 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:03,021 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:03,021 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 13:20:03,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:03,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:03,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:03,021 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 13:20:03,021 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 13:20:03,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:03,024 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:03,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:03,024 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:03,024 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 13:20:03,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:03,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:03,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:03,025 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 13:20:03,025 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 13:20:03,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:03,029 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:03,030 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:03,030 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:03,030 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 13:20:03,030 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:03,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:03,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:03,031 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 13:20:03,031 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 13:20:03,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:03,032 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:03,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 13:20:03,032 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:03,032 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 13:20:03,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:03,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:03,032 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 13:20:03,033 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 13:20:03,033 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:20:03,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:03,039 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:03,039 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 13:20:03,039 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:03,040 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:03,040 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 13:20:03,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:03,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:03,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:03,040 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 13:20:03,042 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 13:20:03,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:03,056 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:03,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 13:20:03,058 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:03,058 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 13:20:03,058 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:03,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:03,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:03,058 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 13:20:03,059 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 13:20:03,059 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:03,063 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:03,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:03,064 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:03,064 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 13:20:03,064 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:03,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:03,064 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 13:20:03,064 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 13:20:03,067 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 13:20:03,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:03,094 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:03,095 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:03,095 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:03,095 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 13:20:03,095 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:03,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:03,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:03,096 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 13:20:03,097 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 13:20:03,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:03,101 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:03,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:03,101 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:03,102 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 13:20:03,102 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:03,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:03,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:03,102 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 13:20:03,103 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 13:20:03,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:03,105 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:03,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:03,106 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:03,106 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 13:20:03,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:03,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:03,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:03,106 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 13:20:03,107 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 13:20:03,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:03,109 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:03,110 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:03,110 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:03,110 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 13:20:03,110 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:03,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:03,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:03,111 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 13:20:03,111 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 13:20:03,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:03,112 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:03,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:03,113 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:03,113 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 13:20:03,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:03,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:03,113 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 13:20:03,113 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 13:20:03,114 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 13:20:03,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:03,121 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:03,121 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 13:20:03,121 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:03,122 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:03,122 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 13:20:03,122 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:03,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:03,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:03,122 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 13:20:03,124 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 13:20:03,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:03,133 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:03,134 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:03,134 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:03,134 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 13:20:03,135 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:03,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:03,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:03,135 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 13:20:03,136 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 13:20:03,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:03,140 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:03,140 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:03,140 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:03,141 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 13:20:03,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:03,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:03,141 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 13:20:03,141 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 13:20:03,145 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-10 13:20:03,145 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:03,176 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:03,176 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:03,176 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:03,177 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 13:20:03,177 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:03,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:03,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:03,177 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 13:20:03,178 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 13:20:03,179 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:03,187 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:03,188 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:03,188 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:03,188 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 13:20:03,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:03,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:03,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:03,188 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 13:20:03,189 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 13:20:03,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:03,194 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:03,194 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:03,195 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:03,195 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 13:20:03,195 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:03,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:03,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:03,195 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 13:20:03,196 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 13:20:03,196 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:03,202 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:03,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:03,203 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:03,203 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 13:20:03,203 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:03,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:03,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:03,204 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 13:20:03,204 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 13:20:03,204 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:03,205 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:03,205 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:03,206 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:03,206 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 13:20:03,206 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:03,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:03,206 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 13:20:03,206 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 13:20:03,213 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 13:20:03,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:03,222 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:03,222 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 13:20:03,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 13:20:03,223 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:03,223 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 13:20:03,223 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:03,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:03,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:03,224 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 13:20:03,225 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 13:20:03,225 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:03,232 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:03,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:03,233 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:03,233 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 13:20:03,233 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:03,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:03,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:03,233 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 13:20:03,234 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 13:20:03,234 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:03,235 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:03,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:03,236 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:03,236 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 13:20:03,236 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:03,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:03,236 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 13:20:03,236 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 13:20:03,237 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 13:20:03,238 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:03,251 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:03,251 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:03,252 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:03,252 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 13:20:03,252 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:03,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:03,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:03,252 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 13:20:03,253 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 13:20:03,253 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:03,256 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:03,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:03,257 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:03,257 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 13:20:03,257 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:03,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:03,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:03,257 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 13:20:03,257 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 13:20:03,257 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:03,259 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:03,259 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:03,259 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:03,259 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 13:20:03,260 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:03,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:03,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:03,260 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 13:20:03,260 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 13:20:03,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:03,261 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:03,262 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:03,262 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:03,262 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 13:20:03,262 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:03,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:03,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:03,263 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 13:20:03,263 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 13:20:03,263 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:03,264 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:03,264 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:03,264 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:03,265 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 13:20:03,265 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:03,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:03,265 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 13:20:03,265 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 13:20:03,265 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 13:20:03,266 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:03,271 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:03,271 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 13:20:03,271 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:03,271 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:03,272 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 13:20:03,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:03,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:03,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:03,272 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 13:20:03,273 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:20:03,273 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:03,300 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:03,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:03,301 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:03,301 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 13:20:03,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:03,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:03,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:03,302 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 13:20:03,302 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:20:03,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:03,304 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:03,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:03,305 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:03,305 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 13:20:03,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:03,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:03,306 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 13:20:03,306 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 13:20:03,308 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-10 13:20:03,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:03,376 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:03,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:03,377 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:03,377 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 13:20:03,377 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:03,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:03,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:03,377 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 13:20:03,378 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:20:03,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:03,385 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:03,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:03,386 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:03,386 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 13:20:03,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:03,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:03,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:03,386 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 13:20:03,387 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:20:03,387 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:03,389 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:03,389 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:03,389 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:03,390 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 13:20:03,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:03,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:03,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:03,390 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 13:20:03,391 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:20:03,391 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:03,393 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:03,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:03,394 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:03,394 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 13:20:03,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:03,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:03,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:03,395 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 13:20:03,395 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:20:03,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:03,398 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:03,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:03,398 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:03,398 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 13:20:03,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:03,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:03,399 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 13:20:03,399 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 13:20:03,400 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 13:20:03,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:03,406 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:03,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:20:03,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:20:03,419 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 3 states. [2018-11-10 13:20:04,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:20:04,021 INFO L93 Difference]: Finished difference Result 381 states and 548 transitions. [2018-11-10 13:20:04,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:20:04,022 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 381 states and 548 transitions. [2018-11-10 13:20:04,025 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 372 [2018-11-10 13:20:04,032 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 381 states to 374 states and 541 transitions. [2018-11-10 13:20:04,033 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 374 [2018-11-10 13:20:04,034 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 374 [2018-11-10 13:20:04,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 374 states and 541 transitions. [2018-11-10 13:20:04,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 13:20:04,036 INFO L705 BuchiCegarLoop]: Abstraction has 374 states and 541 transitions. [2018-11-10 13:20:04,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states and 541 transitions. [2018-11-10 13:20:04,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2018-11-10 13:20:04,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-11-10 13:20:04,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 539 transitions. [2018-11-10 13:20:04,063 INFO L728 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-10 13:20:04,063 INFO L608 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-10 13:20:04,063 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 13:20:04,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 373 states and 539 transitions. [2018-11-10 13:20:04,066 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 371 [2018-11-10 13:20:04,066 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:20:04,066 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:20:04,067 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 13:20:04,067 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:20:04,067 INFO L793 eck$LassoCheckResult]: Stem: 750#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 13:20:04,067 INFO L795 eck$LassoCheckResult]: Loop: 632#L606-3 assume true; 850#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); 876#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); 695#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 696#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); 845#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 13:20:04,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:20:04,068 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-10 13:20:04,068 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:20:04,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:20:04,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:20:04,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:20:04,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:20:04,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:20:04,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:20:04,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:20:04,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1956321088, now seen corresponding path program 1 times [2018-11-10 13:20:04,074 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:20:04,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:20:04,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:20:04,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:20:04,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:20:04,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:20:04,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:20:04,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:20:04,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1962170302, now seen corresponding path program 1 times [2018-11-10 13:20:04,084 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:20:04,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:20:04,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:20:04,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:20:04,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:20:04,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:04,114 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 13:20:04,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:20:04,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 13:20:04,208 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 13:20:04,208 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 13:20:04,208 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 13:20:04,208 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 13:20:04,208 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 13:20:04,208 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:20:04,208 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 13:20:04,208 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 13:20:04,208 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label41_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-10 13:20:04,208 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 13:20:04,208 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 13:20:04,210 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 13:20:04,211 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 13:20:04,214 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 13:20:04,215 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 13:20:04,216 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 13:20:04,217 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 13:20:04,220 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 13:20:04,225 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 13:20:04,310 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 13:20:04,310 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/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 13:20:04,312 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:20:04,313 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:20:04,329 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 13:20:04,329 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_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/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 13:20:04,335 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:20:04,336 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:20:04,338 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 13:20:04,338 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_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/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 13:20:04,359 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:20:04,359 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:20:04,361 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 13:20:04,361 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_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/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 13:20:04,378 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:20:04,378 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:20:04,380 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 13:20:04,380 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_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/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 13:20:04,396 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:20:04,396 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:20:04,411 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 13:20:04,412 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_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/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 13:20:04,415 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:20:04,415 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/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 13:20:04,433 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 13:20:04,433 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:20:04,462 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 13:20:04,464 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 13:20:04,464 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 13:20:04,464 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 13:20:04,464 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 13:20:04,464 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 13:20:04,464 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:20:04,464 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 13:20:04,464 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 13:20:04,464 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label41_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-10 13:20:04,464 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 13:20:04,464 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 13:20:04,466 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 13:20:04,471 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 13:20:04,481 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 13:20:04,482 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 13:20:04,483 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 13:20:04,485 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 13:20:04,491 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 13:20:04,498 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 13:20:04,583 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 13:20:04,583 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 13:20:04,584 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:04,584 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:04,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:20:04,584 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:20:04,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,585 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,585 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:04,585 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:04,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:20:04,586 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:20:04,586 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,586 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:04,587 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,587 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 13:20:04,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:20:04,587 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 13:20:04,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,588 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,588 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:04,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:04,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:20:04,589 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:20:04,589 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,589 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,589 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:04,590 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:04,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:20:04,590 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:20:04,590 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,591 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,591 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:04,591 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,592 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 13:20:04,592 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:20:04,592 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 13:20:04,592 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,593 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:04,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,594 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 13:20:04,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:20:04,594 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 13:20:04,594 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,596 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,596 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:04,597 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:04,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:20:04,597 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:20:04,597 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,599 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,599 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 13:20:04,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:04,599 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:04,600 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 13:20:04,600 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 13:20:04,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,601 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,601 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:04,601 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:04,602 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 13:20:04,602 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 13:20:04,602 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,603 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,604 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:04,604 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,604 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 13:20:04,604 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 13:20:04,605 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:20:04,605 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,605 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:04,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:04,606 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 13:20:04,606 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 13:20:04,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,606 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,607 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:04,607 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:04,607 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 13:20:04,607 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 13:20:04,608 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,608 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,609 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:04,609 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,609 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 13:20:04,609 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 13:20:04,609 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:20:04,610 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,611 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,611 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:04,612 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,612 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 13:20:04,612 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 13:20:04,612 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:20:04,613 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,615 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:04,616 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:04,616 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 13:20:04,616 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 13:20:04,617 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,618 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,619 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 13:20:04,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:04,619 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:04,620 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 13:20:04,620 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 13:20:04,620 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,621 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:04,622 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:04,622 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 13:20:04,622 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 13:20:04,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,624 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:04,624 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,625 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 13:20:04,625 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 13:20:04,625 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 13:20:04,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,625 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,626 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:04,626 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:04,626 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 13:20:04,627 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 13:20:04,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,627 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,627 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:04,628 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:04,628 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 13:20:04,628 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 13:20:04,628 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,629 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:04,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,630 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 13:20:04,630 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 13:20:04,630 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 13:20:04,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,632 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:04,633 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,633 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 13:20:04,633 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 13:20:04,634 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 13:20:04,634 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,637 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:04,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:04,638 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 13:20:04,639 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 13:20:04,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,641 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,641 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 13:20:04,642 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:04,642 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:04,642 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 13:20:04,643 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 13:20:04,643 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,644 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:04,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:04,645 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 13:20:04,645 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 13:20:04,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,647 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,647 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:04,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,648 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 13:20:04,648 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 13:20:04,648 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 13:20:04,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,649 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,649 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:04,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:04,650 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 13:20:04,650 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 13:20:04,650 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,651 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,651 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:04,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:04,651 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 13:20:04,652 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 13:20:04,652 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,653 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:04,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,654 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 13:20:04,654 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 13:20:04,654 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 13:20:04,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,656 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,657 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:04,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,657 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 13:20:04,658 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 13:20:04,658 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 13:20:04,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,662 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,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 13:20:04,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:20:04,663 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:04,663 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 13:20:04,664 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 13:20:04,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,666 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,667 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 13:20:04,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,667 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:04,667 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 13:20:04,667 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:04,668 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 13:20:04,668 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 13:20:04,668 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,670 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,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 13:20:04,670 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:04,670 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 13:20:04,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:04,671 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 13:20:04,671 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 13:20:04,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,674 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,674 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,675 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:04,675 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 13:20:04,675 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,675 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 13:20:04,676 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 13:20:04,676 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:20:04,676 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,677 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,677 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,677 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:04,677 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 13:20:04,677 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:04,678 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 13:20:04,678 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 13:20:04,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,679 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,679 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:04,679 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 13:20:04,679 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:04,680 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 13:20:04,680 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 13:20:04,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,681 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,682 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:04,682 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 13:20:04,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,682 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 13:20:04,682 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 13:20:04,683 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:20:04,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,686 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,687 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:04,687 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 13:20:04,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,687 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 13:20:04,687 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 13:20:04,688 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:20:04,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,694 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,695 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:04,695 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 13:20:04,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:04,695 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 13:20:04,696 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 13:20:04,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,699 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,699 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 13:20:04,699 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,700 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:04,700 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 13:20:04,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:04,700 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 13:20:04,701 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 13:20:04,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,703 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,703 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:04,703 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 13:20:04,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:04,704 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 13:20:04,704 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 13:20:04,705 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,708 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,708 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:04,708 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 13:20:04,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,709 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 13:20:04,709 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 13:20:04,709 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 13:20:04,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,710 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,711 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:04,711 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 13:20:04,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:04,711 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 13:20:04,712 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 13:20:04,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,713 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,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 13:20:04,713 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:04,713 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 13:20:04,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:04,714 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 13:20:04,714 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 13:20:04,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,716 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,717 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:04,717 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 13:20:04,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,717 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 13:20:04,717 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 13:20:04,718 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 13:20:04,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,723 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,724 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:04,724 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 13:20:04,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,724 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 13:20:04,724 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 13:20:04,726 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 13:20:04,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,736 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,736 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,736 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:04,736 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 13:20:04,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:04,737 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 13:20:04,738 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 13:20:04,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,744 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,744 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 13:20:04,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 13:20:04,745 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:04,745 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 13:20:04,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:04,745 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 13:20:04,746 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 13:20:04,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,750 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,751 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:04,751 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 13:20:04,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:04,752 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 13:20:04,753 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 13:20:04,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,758 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,759 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:04,759 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 13:20:04,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,759 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 13:20:04,760 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 13:20:04,761 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 13:20:04,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,762 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,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 13:20:04,762 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:04,763 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 13:20:04,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:04,763 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 13:20:04,764 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 13:20:04,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,765 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,765 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:04,765 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 13:20:04,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:04,766 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 13:20:04,767 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 13:20:04,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,770 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,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 13:20:04,771 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:04,771 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 13:20:04,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,771 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 13:20:04,771 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 13:20:04,773 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 13:20:04,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,785 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,786 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:04,786 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 13:20:04,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,786 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 13:20:04,787 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 13:20:04,789 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 13:20:04,789 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,816 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,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 13:20:04,816 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:04,817 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 13:20:04,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:04,817 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 13:20:04,820 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 13:20:04,820 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,827 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,827 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 13:20:04,828 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,828 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:04,828 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 13:20:04,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:04,829 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 13:20:04,829 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 13:20:04,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,830 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,831 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:04,831 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 13:20:04,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:04,831 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 13:20:04,832 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 13:20:04,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,834 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,835 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,835 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:04,835 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 13:20:04,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,835 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 13:20:04,835 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 13:20:04,836 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 13:20:04,836 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,837 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,837 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,837 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:04,838 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 13:20:04,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:04,838 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 13:20:04,839 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 13:20:04,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,840 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,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 13:20:04,840 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:04,840 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 13:20:04,840 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:04,841 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 13:20:04,841 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 13:20:04,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,842 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,842 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,843 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:04,843 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 13:20:04,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,843 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 13:20:04,843 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 13:20:04,844 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 13:20:04,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,848 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,849 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,849 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:04,849 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 13:20:04,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,849 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 13:20:04,850 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 13:20:04,850 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 13:20:04,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,898 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,899 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:04,900 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 13:20:04,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:04,900 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 13:20:04,901 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 13:20:04,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,906 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,906 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 13:20:04,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,908 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:04,909 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 13:20:04,909 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:04,909 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 13:20:04,909 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:20:04,909 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,911 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,912 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,912 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:04,912 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 13:20:04,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:04,912 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 13:20:04,913 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:20:04,913 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,919 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,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 13:20:04,919 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:04,919 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 13:20:04,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,920 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 13:20:04,920 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 13:20:04,920 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 13:20:04,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,922 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,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 13:20:04,925 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:04,925 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 13:20:04,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:04,926 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 13:20:04,926 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:20:04,926 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,928 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,928 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,929 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:04,929 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 13:20:04,929 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:04,929 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 13:20:04,929 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:20:04,930 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,936 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 13:20:04,937 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:04,937 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 13:20:04,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,937 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 13:20:04,937 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 13:20:04,938 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 13:20:04,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,949 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,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 13:20:04,949 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:04,950 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 13:20:04,950 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,950 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 13:20:04,950 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 13:20:04,952 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 13:20:04,952 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,969 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,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 13:20:04,970 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 13:20:04,970 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 13:20:04,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:20:04,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:20:04,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:20:04,971 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 13:20:04,972 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:20:04,972 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:20:04,990 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:20:04,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:20:04,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:20:04,991 INFO L87 Difference]: Start difference. First operand 373 states and 539 transitions. cyclomatic complexity: 167 Second operand 3 states. [2018-11-10 13:20:05,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:20:05,459 INFO L93 Difference]: Finished difference Result 660 states and 918 transitions. [2018-11-10 13:20:05,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:20:05,461 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 660 states and 918 transitions. [2018-11-10 13:20:05,465 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-10 13:20:05,470 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 660 states to 660 states and 918 transitions. [2018-11-10 13:20:05,470 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 660 [2018-11-10 13:20:05,471 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 660 [2018-11-10 13:20:05,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 660 states and 918 transitions. [2018-11-10 13:20:05,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 13:20:05,475 INFO L705 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-11-10 13:20:05,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states and 918 transitions. [2018-11-10 13:20:05,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2018-11-10 13:20:05,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2018-11-10 13:20:05,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 918 transitions. [2018-11-10 13:20:05,492 INFO L728 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-11-10 13:20:05,492 INFO L608 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-11-10 13:20:05,492 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 13:20:05,492 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 660 states and 918 transitions. [2018-11-10 13:20:05,498 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-10 13:20:05,498 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:20:05,498 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:20:05,499 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 13:20:05,499 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 13:20:05,499 INFO L793 eck$LassoCheckResult]: Stem: 1795#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 1673#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 1674#L606-3 [2018-11-10 13:20:05,502 INFO L795 eck$LassoCheckResult]: Loop: 1674#L606-3 assume true; 1901#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1773#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; 1774#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); 1919#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; 2188#L606-3 assume true; 2186#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 2184#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; 2182#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); 2180#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 2178#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); 2176#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 2174#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); 2172#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 2170#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)); 2168#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); 2166#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); 2164#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); 2162#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 2160#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); 2158#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 2156#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 2154#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 2151#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); 2149#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); 2147#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 2145#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); 2143#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 2141#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 2139#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); 2137#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 2135#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); 2133#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); 2131#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 2129#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 2127#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 2125#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 2123#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); 2121#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 2119#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 2117#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 2115#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); 2113#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 2111#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 2109#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); 2107#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 2105#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); 2103#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); 2101#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 2099#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); 2097#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 2095#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 2093#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)); 2092#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); 2090#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; 1781#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1674#L606-3 [2018-11-10 13:20:05,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:20:05,502 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-10 13:20:05,503 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:20:05,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:20:05,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:20:05,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:20:05,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:20:05,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:20:05,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:20:05,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:20:05,515 INFO L82 PathProgramCache]: Analyzing trace with hash 692590236, now seen corresponding path program 1 times [2018-11-10 13:20:05,516 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:20:05,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:20:05,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:20:05,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:20:05,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:20:05,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:05,585 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 13:20:05,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:20:05,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:20:05,585 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 13:20:05,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:20:05,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:20:05,586 INFO L87 Difference]: Start difference. First operand 660 states and 918 transitions. cyclomatic complexity: 259 Second operand 4 states. [2018-11-10 13:20:06,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:20:06,224 INFO L93 Difference]: Finished difference Result 1228 states and 1699 transitions. [2018-11-10 13:20:06,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:20:06,225 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1228 states and 1699 transitions. [2018-11-10 13:20:06,231 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1224 [2018-11-10 13:20:06,236 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1228 states to 1228 states and 1699 transitions. [2018-11-10 13:20:06,236 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1228 [2018-11-10 13:20:06,237 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1228 [2018-11-10 13:20:06,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1228 states and 1699 transitions. [2018-11-10 13:20:06,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 13:20:06,239 INFO L705 BuchiCegarLoop]: Abstraction has 1228 states and 1699 transitions. [2018-11-10 13:20:06,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states and 1699 transitions. [2018-11-10 13:20:06,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1225. [2018-11-10 13:20:06,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2018-11-10 13:20:06,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1693 transitions. [2018-11-10 13:20:06,257 INFO L728 BuchiCegarLoop]: Abstraction has 1225 states and 1693 transitions. [2018-11-10 13:20:06,257 INFO L608 BuchiCegarLoop]: Abstraction has 1225 states and 1693 transitions. [2018-11-10 13:20:06,257 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 13:20:06,257 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1225 states and 1693 transitions. [2018-11-10 13:20:06,262 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1221 [2018-11-10 13:20:06,262 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:20:06,262 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:20:06,263 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 13:20:06,263 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 13:20:06,264 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 13:20:06,264 INFO L795 eck$LassoCheckResult]: Loop: 3568#L606-3 assume true; 4374#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4372#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; 4370#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); 4368#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 4366#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); 4364#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 4362#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); 4318#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; 3750#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4302#L606-3 assume true; 4301#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4300#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; 4299#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; 3711#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4722#L606-3 assume true; 4186#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4176#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; 4175#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); 4173#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 4171#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); 4169#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 4167#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); 4165#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 4163#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)); 4161#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); 4159#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); 4157#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); 4155#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 4153#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); 4151#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 4149#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 4147#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 4145#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); 4143#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); 4141#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 4139#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); 4137#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 4135#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 4133#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); 4131#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 4129#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); 4127#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); 4125#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 4123#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 4121#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 4119#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 4117#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); 4115#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 4113#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 4111#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 4109#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); 4107#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 4105#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 4103#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); 4101#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 4099#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); 4097#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); 4095#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 4093#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); 4091#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 4089#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 4087#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)); 4085#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); 4082#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; 4083#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 13:20:06,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:20:06,264 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-10 13:20:06,264 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:20:06,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:20:06,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:20:06,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:20:06,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:20:06,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:20:06,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:20:06,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:20:06,268 INFO L82 PathProgramCache]: Analyzing trace with hash 676565178, now seen corresponding path program 1 times [2018-11-10 13:20:06,268 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:20:06,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:20:06,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:20:06,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:20:06,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:20:06,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:06,291 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 13:20:06,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:20:06,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:20:06,291 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 13:20:06,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:20:06,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:20:06,292 INFO L87 Difference]: Start difference. First operand 1225 states and 1693 transitions. cyclomatic complexity: 470 Second operand 3 states. [2018-11-10 13:20:06,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:20:06,681 INFO L93 Difference]: Finished difference Result 1509 states and 2002 transitions. [2018-11-10 13:20:06,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:20:06,681 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1509 states and 2002 transitions. [2018-11-10 13:20:06,688 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1505 [2018-11-10 13:20:06,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1509 states to 1509 states and 2002 transitions. [2018-11-10 13:20:06,695 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1509 [2018-11-10 13:20:06,696 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1509 [2018-11-10 13:20:06,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1509 states and 2002 transitions. [2018-11-10 13:20:06,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 13:20:06,698 INFO L705 BuchiCegarLoop]: Abstraction has 1509 states and 2002 transitions. [2018-11-10 13:20:06,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states and 2002 transitions. [2018-11-10 13:20:06,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1508. [2018-11-10 13:20:06,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1508 states. [2018-11-10 13:20:06,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 2000 transitions. [2018-11-10 13:20:06,718 INFO L728 BuchiCegarLoop]: Abstraction has 1508 states and 2000 transitions. [2018-11-10 13:20:06,719 INFO L608 BuchiCegarLoop]: Abstraction has 1508 states and 2000 transitions. [2018-11-10 13:20:06,719 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 13:20:06,719 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1508 states and 2000 transitions. [2018-11-10 13:20:06,724 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-10 13:20:06,725 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:20:06,725 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:20:06,726 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 13:20:06,726 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 13:20:06,726 INFO L793 eck$LassoCheckResult]: Stem: 6429#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 13:20:06,726 INFO L795 eck$LassoCheckResult]: Loop: 6308#L606-3 assume true; 7548#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7545#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; 7542#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); 7540#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 7538#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); 7534#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 7530#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); 7527#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 7524#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)); 7520#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); 7517#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); 7514#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); 7509#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 7504#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); 7499#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 7494#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 7489#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 6930#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; 6536#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6920#L606-3 assume true; 6918#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6916#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; 6914#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; 6451#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6922#L606-3 assume true; 6921#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6919#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; 6917#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); 6915#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 6913#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); 6911#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 6909#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); 6907#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 6905#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)); 6903#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); 6901#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); 6899#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); 6897#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 6895#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); 6893#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 6891#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 6889#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 6887#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); 6885#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); 6883#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 6881#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); 6879#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 6877#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 6875#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); 6873#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 6871#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); 6869#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); 6867#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 6865#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 6863#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 6861#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 6859#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); 6857#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 6855#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 6853#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 6851#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); 6849#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 6847#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 6845#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); 6843#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 6841#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); 6839#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); 6837#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 6835#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); 6833#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 6831#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 6829#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)); 6827#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); 6823#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; 6824#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 13:20:06,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:20:06,727 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-10 13:20:06,727 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:20:06,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:20:06,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:20:06,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:20:06,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:20:06,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:20:06,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:20:06,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:20:06,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1219893882, now seen corresponding path program 1 times [2018-11-10 13:20:06,731 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:20:06,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:20:06,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:20:06,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:20:06,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:20:06,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:06,757 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 13:20:06,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:20:06,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:20:06,758 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 13:20:06,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:20:06,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:20:06,758 INFO L87 Difference]: Start difference. First operand 1508 states and 2000 transitions. cyclomatic complexity: 494 Second operand 3 states. [2018-11-10 13:20:07,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:20:07,118 INFO L93 Difference]: Finished difference Result 1507 states and 1822 transitions. [2018-11-10 13:20:07,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:20:07,119 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1507 states and 1822 transitions. [2018-11-10 13:20:07,125 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-10 13:20:07,131 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1507 states to 1507 states and 1822 transitions. [2018-11-10 13:20:07,131 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1507 [2018-11-10 13:20:07,132 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1507 [2018-11-10 13:20:07,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1507 states and 1822 transitions. [2018-11-10 13:20:07,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 13:20:07,134 INFO L705 BuchiCegarLoop]: Abstraction has 1507 states and 1822 transitions. [2018-11-10 13:20:07,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states and 1822 transitions. [2018-11-10 13:20:07,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1507. [2018-11-10 13:20:07,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2018-11-10 13:20:07,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1822 transitions. [2018-11-10 13:20:07,152 INFO L728 BuchiCegarLoop]: Abstraction has 1507 states and 1822 transitions. [2018-11-10 13:20:07,152 INFO L608 BuchiCegarLoop]: Abstraction has 1507 states and 1822 transitions. [2018-11-10 13:20:07,152 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 13:20:07,152 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1507 states and 1822 transitions. [2018-11-10 13:20:07,157 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-10 13:20:07,157 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:20:07,157 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:20:07,158 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 13:20:07,158 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 13:20:07,158 INFO L793 eck$LassoCheckResult]: Stem: 9453#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 13:20:07,159 INFO L795 eck$LassoCheckResult]: Loop: 9329#L606-3 assume true; 10126#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 10124#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; 10123#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); 10122#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 10121#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); 10119#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 10117#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 10113#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 10114#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)); 10107#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); 10108#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); 10668#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); 10666#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 10664#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); 10662#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 10660#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 10657#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 9905#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); 9906#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); 10064#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 10062#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); 10060#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 10058#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 10056#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); 10054#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 10052#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); 10050#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); 10048#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 9798#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; 9689#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9791#L606-3 assume true; 9789#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 9787#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; 9785#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); 9783#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 9781#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); 9779#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 9777#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); 9775#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 9773#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)); 9771#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); 9769#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); 9767#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); 9765#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 9763#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); 9761#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 9759#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 9757#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 9755#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); 9753#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); 9751#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 9749#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); 9747#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 9745#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 9743#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); 9741#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 9739#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); 9737#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); 9734#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 9732#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 9730#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 9728#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 9726#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); 9724#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 9722#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 9720#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 9718#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); 9716#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 9714#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 9712#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); 9710#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 9708#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); 9706#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); 9704#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 9702#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); 9700#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 9698#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 9696#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)); 9694#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); 9691#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; 9692#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 13:20:07,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:20:07,159 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-10 13:20:07,159 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:20:07,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:20:07,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:20:07,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:20:07,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:20:07,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:20:07,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:20:07,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:20:07,163 INFO L82 PathProgramCache]: Analyzing trace with hash -606648447, now seen corresponding path program 1 times [2018-11-10 13:20:07,163 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:20:07,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:20:07,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:20:07,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:20:07,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:20:07,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:07,224 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 13:20:07,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:20:07,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:20:07,225 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 13:20:07,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:20:07,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:20:07,225 INFO L87 Difference]: Start difference. First operand 1507 states and 1822 transitions. cyclomatic complexity: 317 Second operand 3 states. [2018-11-10 13:20:07,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:20:07,471 INFO L93 Difference]: Finished difference Result 1496 states and 1778 transitions. [2018-11-10 13:20:07,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:20:07,473 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1496 states and 1778 transitions. [2018-11-10 13:20:07,479 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-10 13:20:07,484 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1496 states to 1496 states and 1778 transitions. [2018-11-10 13:20:07,484 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1496 [2018-11-10 13:20:07,485 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1496 [2018-11-10 13:20:07,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1496 states and 1778 transitions. [2018-11-10 13:20:07,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 13:20:07,487 INFO L705 BuchiCegarLoop]: Abstraction has 1496 states and 1778 transitions. [2018-11-10 13:20:07,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states and 1778 transitions. [2018-11-10 13:20:07,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1496. [2018-11-10 13:20:07,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2018-11-10 13:20:07,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 1778 transitions. [2018-11-10 13:20:07,504 INFO L728 BuchiCegarLoop]: Abstraction has 1496 states and 1778 transitions. [2018-11-10 13:20:07,504 INFO L608 BuchiCegarLoop]: Abstraction has 1496 states and 1778 transitions. [2018-11-10 13:20:07,504 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 13:20:07,504 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1496 states and 1778 transitions. [2018-11-10 13:20:07,508 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-10 13:20:07,508 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:20:07,508 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:20:07,509 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 13:20:07,509 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 13:20:07,509 INFO L793 eck$LassoCheckResult]: Stem: 12452#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 13:20:07,510 INFO L795 eck$LassoCheckResult]: Loop: 12338#L606-3 assume true; 13174#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 13172#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; 13170#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); 13168#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 13166#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); 13164#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 13162#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); 13160#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 13158#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)); 13156#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); 13154#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); 13152#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); 13150#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 13148#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); 13147#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 13145#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 13143#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 13141#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); 13139#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); 13137#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 13135#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); 13133#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 13131#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 13129#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); 13127#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13125#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); 13123#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); 13122#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 12864#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 12865#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 13099#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 13098#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); 13096#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 13094#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 13092#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 13090#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); 13088#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 13086#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 13084#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); 13082#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 13080#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); 13078#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); 13076#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 13074#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); 13072#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 13070#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 13068#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)); 13066#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); 13064#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); 13062#L259 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && (((~a28~0 == 9 && calculate_output_~input == 6) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a25~0 == 1)); 13060#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); 13058#L276 assume !(~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && ~a21~0 == 1 && ~a19~0 == 1 && calculate_output_~input == 5 && !(~a11~0 == 1)); 13056#L280 assume !(~a28~0 == 8 && ~a21~0 == 1 && (!(~a11~0 == 1) && (calculate_output_~input == 1 && ~a17~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 13054#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); 13052#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); 13050#L291 assume !(~a17~0 == 8 && (~a21~0 == 1 && !(~a11~0 == 1) && ~a25~0 == 1 && ~a28~0 == 8 && calculate_output_~input == 6) && ~a19~0 == 1); 13048#L293 assume !((~a19~0 == 1 && ~a17~0 == 8 && ((!(~a25~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11); 13046#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); 13044#L309 assume !((((((calculate_output_~input == 3 && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a28~0 == 11) && !(~a11~0 == 1)); 13042#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); 13040#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); 13038#L331 assume !((!(~a11~0 == 1) && (((calculate_output_~input == 4 && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1); 13036#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)); 13034#L349 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && ((~a25~0 == 1 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 11) && ~a21~0 == 1); 13032#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); 13030#L361 assume !(~a19~0 == 1 && ((~a21~0 == 1 && (!(~a25~0 == 1) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a28~0 == 8) && ~a11~0 == 1); 13028#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)); 13026#L375 assume !(~a19~0 == 1 && (((~a17~0 == 8 && calculate_output_~input == 5 && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a25~0 == 1) && ~a28~0 == 8); 13024#L378 assume !(((!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 4) && ~a28~0 == 10) && ~a17~0 == 8) && !(~a19~0 == 1)) && ~a25~0 == 1); 13022#L380 assume !(~a28~0 == 8 && (~a19~0 == 1 && ~a11~0 == 1 && !(~a25~0 == 1) && ~a17~0 == 9 && calculate_output_~input == 6) && ~a21~0 == 1); 13020#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)); 13018#L394 assume !(((((!(~a25~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 9) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 13016#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)); 13014#L402 assume !(((!(~a11~0 == 1) && ((~a19~0 == 1 && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)); 13012#L404 assume !((~a11~0 == 1 && ~a19~0 == 1 && ~a21~0 == 1 && (~a17~0 == 9 && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a28~0 == 8); 13010#L407 assume !(!(~a11~0 == 1) && ~a21~0 == 1 && (~a19~0 == 1 && ~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 5) && ~a28~0 == 11); 13008#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); 13006#L414 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13004#L414-2 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13002#L417-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13000#L420-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 12998#L423-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 12996#L426-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 12994#L429-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 12992#L432-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 12990#L435-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 12354#L438-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13281#L441-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13279#L444-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13277#L447-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13275#L450-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13273#L453-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13271#L456-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13269#L459-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13267#L462-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13265#L465-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 12548#L468-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13262#L471-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13260#L474-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13258#L477-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13256#L480-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13254#L483-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13252#L486-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13250#L489-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13248#L492-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13246#L495-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13244#L498-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13242#L501-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13240#L504-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13238#L507-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13236#L510-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13234#L513-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13231#L516-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13229#L519-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13227#L522-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13225#L525-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13223#L528-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13221#L531-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13219#L534-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13217#L537-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13215#L540-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13213#L543-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13211#L546-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13209#L549-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13207#L552-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13205#L555-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13203#L558-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13201#L561-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13199#L564-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13197#L567-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13195#L570-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13193#L573-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13191#L576-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13189#L579-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13187#L582-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13185#L585-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13183#L588-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13181#L591-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13179#L594-1 calculate_output_#res := -2; 13177#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 13:20:07,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:20:07,510 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-10 13:20:07,510 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:20:07,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:20:07,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:20:07,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:20:07,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:20:07,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:20:07,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:20:07,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:20:07,514 INFO L82 PathProgramCache]: Analyzing trace with hash 245249823, now seen corresponding path program 1 times [2018-11-10 13:20:07,514 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:20:07,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:20:07,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:20:07,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:20:07,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:20:07,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:20:07,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:20:07,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:20:07,555 INFO L82 PathProgramCache]: Analyzing trace with hash -2003304803, now seen corresponding path program 1 times [2018-11-10 13:20:07,555 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:20:07,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:20:07,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:20:07,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:20:07,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:20:07,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:20:08,016 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 13:20:08,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:20:08,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 13:20:08,746 WARN L179 SmtUtils]: Spent 714.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2018-11-10 13:20:08,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 13:20:08,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:20:08,821 INFO L87 Difference]: Start difference. First operand 1496 states and 1778 transitions. cyclomatic complexity: 285 Second operand 10 states. [2018-11-10 13:20:09,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:20:09,571 INFO L93 Difference]: Finished difference Result 1688 states and 1967 transitions. [2018-11-10 13:20:09,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 13:20:09,574 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1688 states and 1967 transitions. [2018-11-10 13:20:09,579 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1632 [2018-11-10 13:20:09,585 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1688 states to 1688 states and 1967 transitions. [2018-11-10 13:20:09,585 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1688 [2018-11-10 13:20:09,586 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1688 [2018-11-10 13:20:09,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1688 states and 1967 transitions. [2018-11-10 13:20:09,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 13:20:09,589 INFO L705 BuchiCegarLoop]: Abstraction has 1688 states and 1967 transitions. [2018-11-10 13:20:09,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states and 1967 transitions. [2018-11-10 13:20:09,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1546. [2018-11-10 13:20:09,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2018-11-10 13:20:09,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 1825 transitions. [2018-11-10 13:20:09,608 INFO L728 BuchiCegarLoop]: Abstraction has 1546 states and 1825 transitions. [2018-11-10 13:20:09,608 INFO L608 BuchiCegarLoop]: Abstraction has 1546 states and 1825 transitions. [2018-11-10 13:20:09,608 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 13:20:09,608 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1546 states and 1825 transitions. [2018-11-10 13:20:09,612 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1490 [2018-11-10 13:20:09,613 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:20:09,613 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:20:09,613 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:20:09,613 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:20:09,613 INFO L793 eck$LassoCheckResult]: Stem: 15664#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; 17009#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 17007#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; 17004#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); 16301#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 13:20:09,613 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; 16277#L606-3 assume true; 16275#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16273#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; 16271#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); 16269#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 16267#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); 16265#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 16263#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 13:20:09,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:20:09,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1805984299, now seen corresponding path program 1 times [2018-11-10 13:20:09,614 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:20:09,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:20:09,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:20:09,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:20:09,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:20:09,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:20:09,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:20:09,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:20:09,624 INFO L82 PathProgramCache]: Analyzing trace with hash -278812021, now seen corresponding path program 1 times [2018-11-10 13:20:09,624 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:20:09,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:20:09,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:20:09,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:20:09,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:20:09,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:20:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:20:09,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:20:09,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1569761375, now seen corresponding path program 1 times [2018-11-10 13:20:09,629 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:20:09,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:20:09,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:20:09,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:20:09,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:20:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:20:09,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:20:09,823 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 13:20:09,823 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 13:20:09,823 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 13:20:09,823 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 13:20:09,823 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 13:20:09,823 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:20:09,823 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 13:20:09,823 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 13:20:09,823 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label41_true-unreach-call_false-termination.c_Iteration8_Lasso [2018-11-10 13:20:09,823 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 13:20:09,823 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 13:20:09,825 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 13:20:09,830 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 13:20:09,832 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 13:20:09,834 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 13:20:09,836 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 13:20:09,837 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 13:20:09,840 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 13:20:09,842 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 13:20:09,844 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 13:20:09,847 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 13:20:09,848 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 13:20:09,849 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 13:20:09,851 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 13:20:09,852 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 13:20:09,854 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 13:20:09,856 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 13:20:09,863 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 13:20:09,870 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 13:20:09,875 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 13:20:09,877 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 13:20:09,879 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 13:20:10,029 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 13:20:10,029 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/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 13:20:10,034 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:20:10,034 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:20:10,037 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 13:20:10,037 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_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/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 13:20:10,053 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:20:10,054 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:20:10,069 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 13:20:10,069 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_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/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 13:20:10,075 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:20:10,075 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:20:10,077 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 13:20:10,077 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_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/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 13:20:10,093 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:20:10,093 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:20:10,096 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 13:20:10,096 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_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/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 13:20:10,112 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:20:10,112 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:20:10,115 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 13:20:10,115 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_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/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 13:20:10,131 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:20:10,132 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:20:10,147 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 13:20:10,147 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_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/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 13:20:10,150 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:20:10,151 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:20:10,153 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 13:20:10,153 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_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/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 13:20:10,169 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:20:10,169 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:20:10,185 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 13:20:10,185 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_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/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 13:20:10,190 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:20:10,190 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:20:10,206 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 13:20:10,206 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_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/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 13:20:10,209 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:20:10,209 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:20:10,211 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 13:20:10,211 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_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/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 13:20:10,228 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:20:10,228 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:20:10,244 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 13:20:10,244 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_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/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 13:20:10,247 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:20:10,247 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:20:10,263 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 13:20:10,263 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_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/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 13:20:10,266 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:20:10,267 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:20:10,269 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 13:20:10,269 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_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/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 13:20:10,286 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:20:10,286 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:20:10,288 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 13:20:10,288 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_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/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 13:20:10,304 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:20:10,305 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:20:10,320 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 13:20:10,320 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_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/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 13:20:10,323 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:20:10,323 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/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 13:20:10,343 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 13:20:10,343 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:20:10,538 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 13:20:10,538 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_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/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 13:20:10,554 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:20:10,555 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:20:10,558 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 13:20:10,559 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_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/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 13:20:10,574 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:20:10,574 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/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 13:20:10,593 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 13:20:10,593 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:20:10,741 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 13:20:10,742 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_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/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 13:20:10,758 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:20:10,758 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:20:10,774 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 13:20:10,774 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_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/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 13:20:10,777 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:20:10,777 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:20:10,779 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 13:20:10,779 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_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/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 13:20:10,807 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 13:20:10,807 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 13:20:10,810 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 13:20:10,810 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 13:20:10,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 01:20:10 BoogieIcfgContainer [2018-11-10 13:20:10,848 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 13:20:10,849 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 13:20:10,849 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 13:20:10,850 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 13:20:10,851 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:20:01" (3/4) ... [2018-11-10 13:20:10,854 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-10 13:20:10,894 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4a48ea00-3a24-493b-b7c1-4c07c3b0d5b2/bin-2019/uautomizer/witness.graphml [2018-11-10 13:20:10,894 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 13:20:10,895 INFO L168 Benchmark]: Toolchain (without parser) took 10885.23 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 481.8 MB). Free memory was 950.1 MB in the beginning and 1.5 GB in the end (delta: -501.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:20:10,896 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:20:10,896 INFO L168 Benchmark]: CACSL2BoogieTranslator took 358.50 ms. Allocated memory is still 1.0 GB. Free memory was 950.1 MB in the beginning and 923.3 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-11-10 13:20:10,896 INFO L168 Benchmark]: Boogie Procedure Inliner took 101.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 923.3 MB in the beginning and 1.1 GB in the end (delta: -197.5 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-11-10 13:20:10,896 INFO L168 Benchmark]: Boogie Preprocessor took 39.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-10 13:20:10,897 INFO L168 Benchmark]: RCFGBuilder took 976.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 107.0 MB). Peak memory consumption was 107.0 MB. Max. memory is 11.5 GB. [2018-11-10 13:20:10,897 INFO L168 Benchmark]: BuchiAutomizer took 9359.96 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 353.9 MB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -444.0 MB). Peak memory consumption was 523.7 MB. Max. memory is 11.5 GB. [2018-11-10 13:20:10,897 INFO L168 Benchmark]: Witness Printer took 45.97 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 312.6 kB). Peak memory consumption was 312.6 kB. Max. memory is 11.5 GB. [2018-11-10 13:20:10,899 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 358.50 ms. Allocated memory is still 1.0 GB. Free memory was 950.1 MB in the beginning and 923.3 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 101.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 923.3 MB in the beginning and 1.1 GB in the end (delta: -197.5 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 976.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 107.0 MB). Peak memory consumption was 107.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9359.96 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 353.9 MB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -444.0 MB). Peak memory consumption was 523.7 MB. Max. memory is 11.5 GB. * Witness Printer took 45.97 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 312.6 kB). Peak memory consumption was 312.6 kB. 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.3s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 5.4s. Construction of modules took 2.4s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 147 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 1546 states and ocurred in iteration 7. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1469 SDtfs, 3081 SDslu, 489 SDs, 0 SdLazy, 3702 SolverSat, 847 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time LassoAnalysisResults: nont1 unkn0 SFLI4 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital65 mio100 ax100 hnf103 lsp39 ukn90 mio100 lsp100 div100 bol100 ite100 ukn100 eq209 hnf93 smp100 dnf148 smp89 tf102 neg98 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 70ms 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@53a57bef=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7f5612c6=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@53a57bef=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7f5612c6=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@53a57bef=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@7f5612c6=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...