./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label08_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label08_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/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 6ce363081c1dab610a244bdee8a1005551fe87b5 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-5842f4b [2018-11-18 15:40:29,569 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 15:40:29,570 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 15:40:29,577 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 15:40:29,577 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 15:40:29,578 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 15:40:29,579 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 15:40:29,580 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 15:40:29,581 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 15:40:29,582 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 15:40:29,583 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 15:40:29,583 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 15:40:29,584 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 15:40:29,584 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 15:40:29,585 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 15:40:29,586 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 15:40:29,586 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 15:40:29,588 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 15:40:29,589 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 15:40:29,590 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 15:40:29,591 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 15:40:29,592 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 15:40:29,593 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 15:40:29,593 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 15:40:29,594 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 15:40:29,594 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 15:40:29,595 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 15:40:29,596 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 15:40:29,596 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 15:40:29,597 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 15:40:29,597 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 15:40:29,598 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 15:40:29,598 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 15:40:29,598 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 15:40:29,599 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 15:40:29,599 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 15:40:29,599 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 15:40:29,610 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 15:40:29,610 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 15:40:29,611 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 15:40:29,611 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 15:40:29,611 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 15:40:29,611 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 15:40:29,611 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 15:40:29,612 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 15:40:29,612 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 15:40:29,612 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 15:40:29,612 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 15:40:29,612 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 15:40:29,612 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 15:40:29,613 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 15:40:29,613 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 15:40:29,613 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 15:40:29,613 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 15:40:29,613 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 15:40:29,613 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 15:40:29,613 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 15:40:29,614 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 15:40:29,614 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 15:40:29,614 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 15:40:29,614 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 15:40:29,614 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 15:40:29,614 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 15:40:29,615 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 15:40:29,615 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 15:40:29,615 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 15:40:29,615 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 15:40:29,615 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 15:40:29,616 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 15:40:29,616 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_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/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 -> 6ce363081c1dab610a244bdee8a1005551fe87b5 [2018-11-18 15:40:29,641 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 15:40:29,650 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 15:40:29,652 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 15:40:29,654 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 15:40:29,654 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 15:40:29,654 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label08_true-unreach-call_false-termination.c [2018-11-18 15:40:29,694 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/bin-2019/uautomizer/data/b873891ea/1c0b94bbd21f4061a44219626d60c832/FLAGde53ac1b4 [2018-11-18 15:40:30,048 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 15:40:30,049 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/sv-benchmarks/c/eca-rers2012/Problem02_label08_true-unreach-call_false-termination.c [2018-11-18 15:40:30,057 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/bin-2019/uautomizer/data/b873891ea/1c0b94bbd21f4061a44219626d60c832/FLAGde53ac1b4 [2018-11-18 15:40:30,069 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/bin-2019/uautomizer/data/b873891ea/1c0b94bbd21f4061a44219626d60c832 [2018-11-18 15:40:30,071 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 15:40:30,072 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 15:40:30,073 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 15:40:30,073 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 15:40:30,075 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 15:40:30,076 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:40:30" (1/1) ... [2018-11-18 15:40:30,078 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11524d60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:40:30, skipping insertion in model container [2018-11-18 15:40:30,078 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:40:30" (1/1) ... [2018-11-18 15:40:30,084 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 15:40:30,117 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 15:40:30,357 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:40:30,360 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 15:40:30,427 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:40:30,437 INFO L195 MainTranslator]: Completed translation [2018-11-18 15:40:30,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:40:30 WrapperNode [2018-11-18 15:40:30,438 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 15:40:30,438 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 15:40:30,438 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 15:40:30,438 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 15:40:30,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:40:30" (1/1) ... [2018-11-18 15:40:30,503 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:40:30" (1/1) ... [2018-11-18 15:40:30,537 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 15:40:30,537 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 15:40:30,537 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 15:40:30,537 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 15:40:30,545 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:40:30" (1/1) ... [2018-11-18 15:40:30,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:40:30" (1/1) ... [2018-11-18 15:40:30,548 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:40:30" (1/1) ... [2018-11-18 15:40:30,548 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:40:30" (1/1) ... [2018-11-18 15:40:30,562 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:40:30" (1/1) ... [2018-11-18 15:40:30,570 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:40:30" (1/1) ... [2018-11-18 15:40:30,574 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:40:30" (1/1) ... [2018-11-18 15:40:30,578 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 15:40:30,579 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 15:40:30,579 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 15:40:30,579 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 15:40:30,580 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:40:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/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-18 15:40:30,628 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 15:40:30,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 15:40:30,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 15:40:31,405 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 15:40:31,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:40:31 BoogieIcfgContainer [2018-11-18 15:40:31,406 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 15:40:31,406 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 15:40:31,406 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 15:40:31,409 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 15:40:31,409 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 15:40:31,410 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 03:40:30" (1/3) ... [2018-11-18 15:40:31,410 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@36f4a73b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 03:40:31, skipping insertion in model container [2018-11-18 15:40:31,411 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 15:40:31,411 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:40:30" (2/3) ... [2018-11-18 15:40:31,411 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@36f4a73b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 03:40:31, skipping insertion in model container [2018-11-18 15:40:31,411 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 15:40:31,411 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:40:31" (3/3) ... [2018-11-18 15:40:31,413 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label08_true-unreach-call_false-termination.c [2018-11-18 15:40:31,446 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 15:40:31,446 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 15:40:31,446 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 15:40:31,446 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 15:40:31,446 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 15:40:31,446 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 15:40:31,447 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 15:40:31,447 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 15:40:31,447 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 15:40:31,460 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-18 15:40:31,483 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-18 15:40:31,483 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:40:31,483 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:40:31,489 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 15:40:31,489 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 15:40:31,490 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 15:40:31,490 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-18 15:40:31,495 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-18 15:40:31,495 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:40:31,495 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:40:31,496 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 15:40:31,496 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 15:40:31,501 INFO L794 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-18 15:40:31,501 INFO L796 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 !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);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 ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~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-18 15:40:31,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:40:31,505 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 15:40:31,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:40:31,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:40:31,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:31,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:40:31,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:31,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:40:31,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:40:31,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:40:31,586 INFO L82 PathProgramCache]: Analyzing trace with hash 34545679, now seen corresponding path program 1 times [2018-11-18 15:40:31,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:40:31,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:40:31,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:31,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:40:31,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:31,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:40:31,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:40:31,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:40:31,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1805985165, now seen corresponding path program 1 times [2018-11-18 15:40:31,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:40:31,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:40:31,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:31,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:40:31,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:31,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:40:31,680 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-18 15:40:31,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:40:31,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 15:40:31,795 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 15:40:31,796 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 15:40:31,796 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 15:40:31,796 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 15:40:31,796 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 15:40:31,796 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:40:31,797 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 15:40:31,797 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 15:40:31,797 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label08_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-18 15:40:31,797 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 15:40:31,797 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 15:40:31,816 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-18 15:40:31,821 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-18 15:40:31,845 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-18 15:40:31,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-18 15:40:31,853 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-18 15:40:31,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-18 15:40:31,859 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-18 15:40:31,866 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-18 15:40:32,034 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 15:40:32,035 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/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-18 15:40:32,047 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 15:40:32,047 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 15:40:32,057 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 15:40:32,057 INFO L448 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_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/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-18 15:40:32,074 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 15:40:32,075 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 15:40:32,083 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 15:40:32,083 INFO L448 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_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/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-18 15:40:32,104 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 15:40:32,104 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 15:40:32,107 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 15:40:32,107 INFO L448 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_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/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-18 15:40:32,126 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 15:40:32,126 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 15:40:32,131 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 15:40:32,131 INFO L448 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_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/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-18 15:40:32,157 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 15:40:32,157 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 15:40:32,163 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 15:40:32,163 INFO L448 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_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/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-18 15:40:32,184 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 15:40:32,185 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 15:40:32,187 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 15:40:32,187 INFO L448 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_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/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-18 15:40:32,206 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 15:40:32,206 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 15:40:32,210 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 15:40:32,210 INFO L448 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_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/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-18 15:40:32,229 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 15:40:32,229 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/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-18 15:40:32,259 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 15:40:32,260 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 15:40:32,291 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 15:40:32,292 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 15:40:32,292 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 15:40:32,293 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 15:40:32,293 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 15:40:32,293 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 15:40:32,293 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:40:32,293 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 15:40:32,293 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 15:40:32,293 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label08_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-18 15:40:32,293 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 15:40:32,294 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 15:40:32,296 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-18 15:40:32,304 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-18 15:40:32,307 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-18 15:40:32,341 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-18 15:40:32,346 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-18 15:40:32,348 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-18 15:40:32,380 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-18 15:40:32,382 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-18 15:40:32,560 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 15:40:32,564 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 15:40:32,566 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:32,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:32,567 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:32,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:32,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:32,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:40:32,570 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:40:32,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:32,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:32,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:32,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:32,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:32,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:32,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:32,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:40:32,584 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:40:32,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:32,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:32,587 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:32,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:32,587 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:32,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:32,588 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 15:40:32,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:40:32,589 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:40:32,589 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:32,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:32,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-18 15:40:32,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:32,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:32,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:32,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:32,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:40:32,606 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:40:32,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:32,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:32,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-18 15:40:32,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:32,612 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:32,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:32,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:32,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:40:32,612 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:40:32,612 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:32,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:32,614 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:32,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:32,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:32,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:32,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:32,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:40:32,616 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:40:32,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:32,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:32,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-18 15:40:32,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:32,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:32,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:32,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:32,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:40:32,620 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:40:32,621 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:32,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:32,622 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:32,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:32,625 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:32,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:32,625 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 15:40:32,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:40:32,626 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:40:32,626 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:32,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:32,631 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-18 15:40:32,631 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:32,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:32,632 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:32,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:32,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:32,632 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:40:32,633 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 15:40:32,633 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:32,641 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:32,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:32,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:32,642 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:32,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:32,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:32,644 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:40:32,644 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 15:40:32,644 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:32,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:32,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:32,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:32,649 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:32,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:32,649 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 15:40:32,649 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:40:32,651 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 15:40:32,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:32,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:32,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:32,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:32,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:32,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:32,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:32,666 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:40:32,667 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 15:40:32,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:32,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:32,672 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:32,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:32,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:32,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:32,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:32,673 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:40:32,674 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 15:40:32,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:32,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:32,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:32,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:32,677 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:32,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:32,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:32,677 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:40:32,677 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 15:40:32,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:32,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:32,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:32,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:32,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:32,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:32,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:32,685 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:40:32,685 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 15:40:32,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:32,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:32,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:32,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:32,689 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:32,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:32,689 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 15:40:32,690 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:40:32,690 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:40:32,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:32,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:32,695 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-18 15:40:32,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:32,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:32,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:32,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:32,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:32,697 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:40:32,698 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:40:32,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:32,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:32,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:32,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:32,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:32,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:32,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:32,707 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:40:32,707 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:40:32,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:32,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:32,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:32,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:32,710 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:32,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:32,710 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 15:40:32,711 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:40:32,712 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 15:40:32,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:32,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:32,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:32,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:32,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:32,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:32,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:32,727 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:40:32,728 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:40:32,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:32,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:32,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:32,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:32,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:32,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:32,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:32,732 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:40:32,732 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:40:32,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:32,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:32,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:32,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:32,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:32,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:32,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:32,735 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:40:32,736 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:40:32,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:32,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:32,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:32,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:32,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:32,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:32,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:32,739 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:40:32,739 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:40:32,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:32,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:32,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:32,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:32,741 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:32,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:32,741 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 15:40:32,741 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:40:32,742 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 15:40:32,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:32,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:32,746 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-18 15:40:32,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:32,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:32,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:32,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:32,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:32,750 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:40:32,751 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 15:40:32,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:32,756 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:32,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:32,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:32,757 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:32,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:32,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:32,757 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:40:32,758 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 15:40:32,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:32,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:32,760 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:32,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:32,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:32,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:32,761 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 15:40:32,761 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:40:32,763 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 15:40:32,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:32,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:32,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:32,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:32,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:32,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:32,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:32,776 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:40:32,776 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 15:40:32,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:32,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:32,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:32,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:32,783 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:32,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:32,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:32,784 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:40:32,784 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 15:40:32,784 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:32,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:32,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-18 15:40:32,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:32,789 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:32,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:32,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:32,789 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:40:32,790 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 15:40:32,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:32,791 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:32,792 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:32,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:32,792 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:32,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:32,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:32,793 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:40:32,793 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 15:40:32,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:32,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:32,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:32,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:32,795 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:32,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:32,795 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 15:40:32,795 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:40:32,795 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 15:40:32,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:32,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:32,799 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-18 15:40:32,799 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:32,800 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:32,800 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:40:32,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:32,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:32,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:32,800 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:40:32,801 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 15:40:32,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:32,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:32,812 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:32,812 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:32,812 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:40:32,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:32,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:32,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:32,813 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:40:32,813 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 15:40:32,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:32,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:32,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-18 15:40:32,816 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:32,817 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:40:32,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:32,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:32,817 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 15:40:32,817 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:40:32,819 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 15:40:32,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:32,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:32,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:32,841 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:32,842 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:40:32,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:32,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:32,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:32,842 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:40:32,845 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 15:40:32,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:32,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:32,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-18 15:40:32,849 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:32,849 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:40:32,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:32,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:32,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:32,849 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:40:32,850 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 15:40:32,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:32,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:32,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:32,852 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:32,853 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:40:32,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:32,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:32,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:32,853 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:40:32,853 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 15:40:32,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:32,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:32,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:32,861 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:32,861 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:40:32,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:32,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:32,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:32,862 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:40:32,862 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 15:40:32,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:32,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:32,863 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:32,863 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:32,863 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:40:32,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:32,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:32,864 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 15:40:32,864 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:40:32,865 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:40:32,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:32,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:32,869 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-18 15:40:32,869 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:32,870 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:32,870 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 15:40:32,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:32,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:32,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:32,871 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:40:32,872 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:40:32,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:32,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:32,887 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:32,887 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:32,887 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 15:40:32,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:32,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:32,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:32,888 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:40:32,888 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:40:32,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:32,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:32,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-18 15:40:32,892 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:32,892 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 15:40:32,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:32,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:32,893 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 15:40:32,893 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:40:32,896 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 15:40:32,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:32,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:32,923 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:32,924 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:32,924 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 15:40:32,924 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:32,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:32,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:32,924 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:40:32,925 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:40:32,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:32,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:32,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-18 15:40:32,930 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:32,930 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 15:40:32,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:32,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:32,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:32,931 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:40:32,931 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:40:32,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:32,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:32,935 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:32,935 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:32,935 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 15:40:32,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:32,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:32,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:32,936 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:40:32,936 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:40:32,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:32,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:32,940 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:32,940 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:32,940 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 15:40:32,940 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:32,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:32,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:32,941 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:40:32,941 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:40:32,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:32,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:32,943 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:32,943 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:32,943 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 15:40:32,943 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:32,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:32,944 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 15:40:32,944 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:40:32,945 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 15:40:32,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:32,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:32,952 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-18 15:40:32,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-18 15:40:32,953 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:32,953 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:40:32,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:32,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:32,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:32,954 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:40:32,956 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 15:40:32,956 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:32,966 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:32,966 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:32,967 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:32,967 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:40:32,967 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:32,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:32,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:32,967 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:40:32,968 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 15:40:32,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:32,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:32,973 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:32,974 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:32,974 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:40:32,974 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:32,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:32,974 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 15:40:32,974 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:40:32,979 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 15:40:32,979 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:33,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:33,012 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:33,012 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:33,012 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:40:33,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:33,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:33,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:33,013 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:40:33,014 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 15:40:33,014 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:33,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:33,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-18 15:40:33,020 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:33,021 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:40:33,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:33,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:33,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:33,021 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:40:33,022 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 15:40:33,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:33,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:33,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:33,026 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:33,026 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:40:33,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:33,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:33,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:33,027 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:40:33,027 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 15:40:33,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:33,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:33,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-18 15:40:33,032 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:33,032 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:40:33,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:33,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:33,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:33,032 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:40:33,033 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 15:40:33,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:33,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:33,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:33,035 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:33,035 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:40:33,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:33,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:33,035 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 15:40:33,035 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:40:33,037 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 15:40:33,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:33,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:33,046 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-18 15:40:33,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:33,047 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:33,047 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:40:33,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:33,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:33,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:33,047 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:40:33,048 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:40:33,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:33,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:33,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-18 15:40:33,057 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:33,057 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:40:33,057 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:33,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:33,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:33,057 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:40:33,058 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:40:33,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:33,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:33,060 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:33,060 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:33,060 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:40:33,060 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:33,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:33,060 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 15:40:33,060 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:40:33,062 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 15:40:33,062 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:33,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:33,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:33,077 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:33,078 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:40:33,078 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:33,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:33,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:33,078 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:40:33,078 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:40:33,079 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:33,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:33,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:33,083 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:33,083 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:40:33,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:33,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:33,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:33,083 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:40:33,084 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:40:33,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:33,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:33,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:33,086 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:33,086 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:40:33,086 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:33,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:33,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:33,086 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:40:33,087 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:40:33,087 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:33,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:33,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:33,089 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:33,089 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:40:33,089 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:33,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:33,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:33,089 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:40:33,089 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:40:33,090 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:33,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:33,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-18 15:40:33,095 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:33,096 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:40:33,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:33,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:33,096 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 15:40:33,096 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:40:33,097 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 15:40:33,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:33,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:33,102 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-18 15:40:33,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:33,103 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:33,103 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:40:33,103 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:33,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:33,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:33,104 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 15:40:33,105 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:40:33,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:33,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:33,129 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:33,129 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:33,129 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:40:33,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:33,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:33,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:33,130 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 15:40:33,130 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:40:33,130 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:33,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:33,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:33,133 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:33,133 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:40:33,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:33,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:33,134 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 15:40:33,134 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 15:40:33,136 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-18 15:40:33,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:33,198 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:33,198 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:33,199 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:33,199 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:40:33,199 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:33,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:33,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:33,199 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 15:40:33,200 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:40:33,200 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:33,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:33,208 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:33,209 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:33,209 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:40:33,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:33,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:33,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:33,209 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 15:40:33,210 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:40:33,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:33,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:33,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:33,214 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:33,214 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:40:33,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:33,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:33,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:33,220 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 15:40:33,221 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:40:33,221 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:33,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:33,224 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:33,224 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:33,224 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:40:33,224 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:33,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:33,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:33,225 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 15:40:33,225 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:40:33,226 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:33,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:33,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:33,228 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:33,229 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:40:33,229 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:33,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:33,229 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 15:40:33,229 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 15:40:33,230 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 15:40:33,230 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:33,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:33,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:40:33,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:40:33,247 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 3 states. [2018-11-18 15:40:33,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:40:33,844 INFO L93 Difference]: Finished difference Result 381 states and 548 transitions. [2018-11-18 15:40:33,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:40:33,846 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 381 states and 548 transitions. [2018-11-18 15:40:33,849 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 372 [2018-11-18 15:40:33,858 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 381 states to 374 states and 541 transitions. [2018-11-18 15:40:33,859 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 374 [2018-11-18 15:40:33,860 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 374 [2018-11-18 15:40:33,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 374 states and 541 transitions. [2018-11-18 15:40:33,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:40:33,862 INFO L705 BuchiCegarLoop]: Abstraction has 374 states and 541 transitions. [2018-11-18 15:40:33,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states and 541 transitions. [2018-11-18 15:40:33,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2018-11-18 15:40:33,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-11-18 15:40:33,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 539 transitions. [2018-11-18 15:40:33,889 INFO L728 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-18 15:40:33,889 INFO L608 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-18 15:40:33,890 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 15:40:33,890 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 373 states and 539 transitions. [2018-11-18 15:40:33,892 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 371 [2018-11-18 15:40:33,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:40:33,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:40:33,892 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 15:40:33,892 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:40:33,893 INFO L794 eck$LassoCheckResult]: Stem: 752#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-18 15:40:33,893 INFO L796 eck$LassoCheckResult]: Loop: 632#L606-3 assume true; 855#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 732#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);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 !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 879#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 760#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 694#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 695#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 850#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 633#L54 assume (((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0);~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-18 15:40:33,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:40:33,893 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-18 15:40:33,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:40:33,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:40:33,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:33,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:40:33,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:33,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:40:33,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:40:33,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:40:33,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1956321088, now seen corresponding path program 1 times [2018-11-18 15:40:33,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:40:33,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:40:33,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:33,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:40:33,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:33,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:40:33,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:40:33,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:40:33,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1962170302, now seen corresponding path program 1 times [2018-11-18 15:40:33,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:40:33,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:40:33,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:33,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:40:33,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:33,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:40:33,951 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-18 15:40:33,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:40:33,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 15:40:34,034 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 15:40:34,034 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 15:40:34,034 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 15:40:34,034 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 15:40:34,034 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 15:40:34,034 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:40:34,034 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 15:40:34,034 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 15:40:34,034 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label08_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-18 15:40:34,034 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 15:40:34,034 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 15:40:34,035 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-18 15:40:34,037 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-18 15:40:34,040 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-18 15:40:34,042 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-18 15:40:34,044 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-18 15:40:34,046 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-18 15:40:34,049 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-18 15:40:34,054 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-18 15:40:34,147 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 15:40:34,147 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/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-18 15:40:34,152 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 15:40:34,152 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 15:40:34,154 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 15:40:34,154 INFO L448 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_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/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-18 15:40:34,173 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 15:40:34,173 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 15:40:34,176 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 15:40:34,176 INFO L448 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_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/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-18 15:40:34,192 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 15:40:34,192 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 15:40:34,194 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 15:40:34,194 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=4} Honda state: {~a19~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/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-18 15:40:34,219 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 15:40:34,219 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 15:40:34,221 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 15:40:34,221 INFO L448 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_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/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-18 15:40:34,247 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 15:40:34,247 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 15:40:34,249 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 15:40:34,249 INFO L448 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_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/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-18 15:40:34,268 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 15:40:34,268 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/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-18 15:40:34,295 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 15:40:34,295 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 15:40:34,317 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 15:40:34,318 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 15:40:34,318 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 15:40:34,318 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 15:40:34,318 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 15:40:34,319 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 15:40:34,319 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:40:34,319 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 15:40:34,319 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 15:40:34,319 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label08_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-18 15:40:34,319 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 15:40:34,319 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 15:40:34,320 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-18 15:40:34,328 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-18 15:40:34,340 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-18 15:40:34,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:40:34,356 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-18 15:40:34,357 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-18 15:40:34,361 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-18 15:40:34,369 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-18 15:40:34,446 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 15:40:34,446 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 15:40:34,446 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:34,447 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:34,447 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:40:34,447 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:40:34,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,448 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,449 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:34,449 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:34,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:40:34,450 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:40:34,450 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,451 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:34,451 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,451 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 15:40:34,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:40:34,452 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:40:34,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,452 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,452 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:34,453 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:34,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:40:34,453 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:40:34,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,454 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:34,454 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:34,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:40:34,456 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:40:34,456 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:34,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,457 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 15:40:34,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:40:34,458 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:40:34,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,459 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,459 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:34,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,460 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 15:40:34,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:40:34,460 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:40:34,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:34,464 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:34,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:40:34,464 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:40:34,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,466 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-18 15:40:34,466 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:34,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:34,467 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:40:34,467 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 15:40:34,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,467 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,468 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:34,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:34,468 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:40:34,469 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 15:40:34,469 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,470 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:34,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,471 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 15:40:34,471 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:40:34,471 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:40:34,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,472 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:34,472 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:34,473 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:40:34,473 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 15:40:34,473 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,474 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:34,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:34,475 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:40:34,475 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 15:40:34,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,476 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:34,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,477 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 15:40:34,477 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:40:34,477 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:40:34,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:34,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,480 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 15:40:34,480 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:40:34,481 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:40:34,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:34,485 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:34,485 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:40:34,485 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 15:40:34,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,488 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-18 15:40:34,488 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:34,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:34,489 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:40:34,489 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:40:34,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:34,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:34,491 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:40:34,492 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:40:34,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:34,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,494 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 15:40:34,494 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:40:34,495 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 15:40:34,495 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,496 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:34,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:34,496 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:40:34,497 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:40:34,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,497 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:34,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:34,498 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:40:34,499 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:40:34,499 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:34,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,501 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 15:40:34,501 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:40:34,501 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 15:40:34,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:34,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,508 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 15:40:34,508 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:40:34,509 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 15:40:34,509 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,512 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:34,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:34,513 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:40:34,514 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:40:34,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,524 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-18 15:40:34,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:34,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:34,525 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:40:34,525 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 15:40:34,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:34,527 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:34,527 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:40:34,527 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 15:40:34,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:34,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,530 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 15:40:34,530 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:40:34,531 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 15:40:34,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,532 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:34,532 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:34,532 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:40:34,533 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 15:40:34,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,533 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:34,534 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:34,534 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:40:34,536 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 15:40:34,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:34,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,538 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 15:40:34,538 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:40:34,538 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 15:40:34,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,541 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:34,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,541 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 15:40:34,542 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:40:34,542 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 15:40:34,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,553 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:40:34,554 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:34,554 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:40:34,555 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 15:40:34,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,557 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-18 15:40:34,558 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,558 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:34,558 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:40:34,558 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:34,559 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:40:34,560 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 15:40:34,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,562 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,562 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:34,562 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:40:34,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:34,563 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:40:34,563 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 15:40:34,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,566 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,566 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:34,567 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:40:34,567 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,567 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 15:40:34,567 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:40:34,568 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:40:34,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,569 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:34,569 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:40:34,569 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:34,569 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:40:34,570 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 15:40:34,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,571 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,571 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:34,571 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:40:34,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:34,571 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:40:34,571 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 15:40:34,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,573 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:34,573 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:40:34,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,574 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 15:40:34,574 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:40:34,574 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:40:34,574 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,578 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:34,578 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:40:34,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,578 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 15:40:34,578 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:40:34,579 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:40:34,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,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-18 15:40:34,585 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:34,585 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:40:34,585 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:34,585 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:40:34,586 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 15:40:34,586 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,589 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-18 15:40:34,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-18 15:40:34,590 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:34,590 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 15:40:34,590 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:34,590 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:40:34,590 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:40:34,591 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,593 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,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-18 15:40:34,593 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:34,593 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 15:40:34,593 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:34,594 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:40:34,594 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:40:34,594 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,598 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,598 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:34,598 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 15:40:34,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,598 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 15:40:34,599 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:40:34,599 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 15:40:34,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,600 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,601 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:34,601 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 15:40:34,601 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:34,601 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:40:34,601 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:40:34,602 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,602 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,603 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,603 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:34,603 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 15:40:34,603 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:34,603 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:40:34,604 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:40:34,604 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,606 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,606 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:34,607 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 15:40:34,607 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,607 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 15:40:34,607 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:40:34,608 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 15:40:34,608 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,613 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:34,613 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 15:40:34,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,613 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 15:40:34,614 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:40:34,615 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 15:40:34,615 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,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-18 15:40:34,627 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:34,627 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 15:40:34,627 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:34,627 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:40:34,629 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:40:34,629 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,634 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,634 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-18 15:40:34,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,635 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:34,635 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:40:34,635 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:34,636 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:40:34,636 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 15:40:34,637 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,641 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:34,641 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:40:34,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:34,642 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:40:34,643 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 15:40:34,643 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,648 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,649 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:34,649 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:40:34,649 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,649 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 15:40:34,649 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:40:34,651 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 15:40:34,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,652 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,652 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:34,653 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:40:34,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:34,653 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:40:34,654 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 15:40:34,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,655 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,655 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:34,655 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:40:34,656 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:34,656 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:40:34,657 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 15:40:34,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,661 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:34,661 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:40:34,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,662 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 15:40:34,662 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:40:34,663 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 15:40:34,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,672 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,672 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:34,672 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:40:34,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,673 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 15:40:34,673 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:40:34,675 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 15:40:34,676 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,691 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:34,691 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:40:34,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:34,692 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:40:34,693 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 15:40:34,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,701 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-18 15:40:34,701 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,702 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:34,702 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:40:34,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:34,702 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:40:34,702 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:40:34,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,704 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:34,705 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:40:34,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:34,705 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:40:34,705 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:40:34,705 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,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-18 15:40:34,709 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:34,709 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:40:34,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,709 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 15:40:34,709 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:40:34,709 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 15:40:34,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,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-18 15:40:34,711 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:34,711 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:40:34,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:34,712 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:40:34,712 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:40:34,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,714 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:34,714 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:40:34,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:34,759 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:40:34,759 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:40:34,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,761 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:34,761 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:40:34,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,761 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 15:40:34,761 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:40:34,762 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 15:40:34,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,768 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:34,768 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:40:34,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,769 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 15:40:34,769 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:40:34,769 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 15:40:34,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,779 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:34,779 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:40:34,779 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:34,780 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:40:34,780 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:40:34,780 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,785 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-18 15:40:34,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,785 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:34,786 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:40:34,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:34,786 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 15:40:34,787 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:40:34,788 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,790 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,790 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:34,790 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:40:34,790 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:34,791 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 15:40:34,791 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:40:34,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,797 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:34,797 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:40:34,797 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,797 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 15:40:34,797 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 15:40:34,798 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 15:40:34,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,800 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,801 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,801 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:34,801 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:40:34,801 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:34,801 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 15:40:34,802 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:40:34,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,804 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:34,804 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:40:34,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:34,805 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 15:40:34,805 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:40:34,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,807 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,808 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:40:34,808 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:34,808 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:40:34,808 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,808 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 15:40:34,808 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 15:40:34,809 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 15:40:34,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,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-18 15:40:34,817 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:34,817 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:40:34,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,817 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 15:40:34,817 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 15:40:34,818 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 15:40:34,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,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-18 15:40:34,841 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:40:34,841 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:40:34,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:40:34,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:40:34,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:40:34,841 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 15:40:34,842 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:40:34,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:40:34,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:40:34,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:40:34,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:40:34,857 INFO L87 Difference]: Start difference. First operand 373 states and 539 transitions. cyclomatic complexity: 167 Second operand 3 states. [2018-11-18 15:40:35,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:40:35,286 INFO L93 Difference]: Finished difference Result 660 states and 918 transitions. [2018-11-18 15:40:35,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:40:35,287 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 660 states and 918 transitions. [2018-11-18 15:40:35,291 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-18 15:40:35,295 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 660 states to 660 states and 918 transitions. [2018-11-18 15:40:35,295 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 660 [2018-11-18 15:40:35,297 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 660 [2018-11-18 15:40:35,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 660 states and 918 transitions. [2018-11-18 15:40:35,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:40:35,299 INFO L705 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-11-18 15:40:35,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states and 918 transitions. [2018-11-18 15:40:35,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2018-11-18 15:40:35,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2018-11-18 15:40:35,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 918 transitions. [2018-11-18 15:40:35,318 INFO L728 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-11-18 15:40:35,318 INFO L608 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-11-18 15:40:35,318 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 15:40:35,318 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 660 states and 918 transitions. [2018-11-18 15:40:35,324 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-18 15:40:35,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:40:35,324 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:40:35,325 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 15:40:35,325 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-18 15:40:35,326 INFO L794 eck$LassoCheckResult]: Stem: 1793#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 1672#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 1673#L606-3 [2018-11-18 15:40:35,327 INFO L796 eck$LassoCheckResult]: Loop: 1673#L606-3 assume true; 2302#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 2300#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 1933#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 1934#L35 assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res := 22; 1685#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 2139#L606-3 assume true; 2137#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 2135#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 2133#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 2131#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 2129#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 2127#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 2125#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 2123#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 2121#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 2119#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 2117#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 2115#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 2113#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 2111#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 2109#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 2107#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 2052#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 2053#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 2292#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 2289#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 2287#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 2285#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 2050#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 2051#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 2066#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 2064#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 2062#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 2060#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 2061#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 2149#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 2054#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 2055#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 2153#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 2154#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 2157#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 2159#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 2161#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 2162#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 2194#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 2165#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 2166#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 2167#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 2169#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 2275#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 2273#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 2271#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 2269#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 2267#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 2265#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 2250#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1673#L606-3 [2018-11-18 15:40:35,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:40:35,327 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-18 15:40:35,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:40:35,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:40:35,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:35,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:40:35,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:40:35,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:40:35,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:40:35,331 INFO L82 PathProgramCache]: Analyzing trace with hash 692590236, now seen corresponding path program 1 times [2018-11-18 15:40:35,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:40:35,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:40:35,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:35,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:40:35,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:35,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:40:35,412 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-18 15:40:35,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:40:35,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 15:40:35,412 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:40:35,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 15:40:35,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 15:40:35,413 INFO L87 Difference]: Start difference. First operand 660 states and 918 transitions. cyclomatic complexity: 259 Second operand 4 states. [2018-11-18 15:40:35,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:40:35,980 INFO L93 Difference]: Finished difference Result 1228 states and 1699 transitions. [2018-11-18 15:40:35,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 15:40:35,980 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1228 states and 1699 transitions. [2018-11-18 15:40:35,986 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1224 [2018-11-18 15:40:35,992 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1228 states to 1228 states and 1699 transitions. [2018-11-18 15:40:35,992 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1228 [2018-11-18 15:40:35,993 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1228 [2018-11-18 15:40:35,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1228 states and 1699 transitions. [2018-11-18 15:40:35,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:40:35,995 INFO L705 BuchiCegarLoop]: Abstraction has 1228 states and 1699 transitions. [2018-11-18 15:40:35,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states and 1699 transitions. [2018-11-18 15:40:36,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1225. [2018-11-18 15:40:36,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2018-11-18 15:40:36,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1693 transitions. [2018-11-18 15:40:36,015 INFO L728 BuchiCegarLoop]: Abstraction has 1225 states and 1693 transitions. [2018-11-18 15:40:36,015 INFO L608 BuchiCegarLoop]: Abstraction has 1225 states and 1693 transitions. [2018-11-18 15:40:36,015 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 15:40:36,015 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1225 states and 1693 transitions. [2018-11-18 15:40:36,020 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1221 [2018-11-18 15:40:36,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:40:36,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:40:36,022 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 15:40:36,022 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-18 15:40:36,022 INFO L794 eck$LassoCheckResult]: Stem: 3689#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-18 15:40:36,024 INFO L796 eck$LassoCheckResult]: Loop: 3568#L606-3 assume true; 4600#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4597#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);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; 4596#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 4595#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 4594#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 4593#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 4592#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 4590#L50 assume 1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0;~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; 4476#L606-3 assume true; 4473#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4469#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);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; 4465#L30 assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~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; 4609#L606-3 assume true; 4608#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4607#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);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; 4606#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 4605#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 4493#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 4494#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 4626#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 4497#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 4498#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 4501#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 4502#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 4662#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 4667#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 4665#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 4663#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 3766#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 3690#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 3692#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 3836#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 3636#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 3637#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 3638#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 3639#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 4059#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 3664#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 3665#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 3666#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 3667#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 4073#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 4495#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 4356#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 4355#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 4354#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 4353#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 4352#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 4351#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 4349#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 4347#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 4345#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 4343#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 4341#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 4339#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 4338#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 4336#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 4334#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 4332#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 4330#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 4328#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 4326#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 4267#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-18 15:40:36,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:40:36,024 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-18 15:40:36,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:40:36,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:40:36,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:36,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:40:36,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:36,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:40:36,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:40:36,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:40:36,028 INFO L82 PathProgramCache]: Analyzing trace with hash 676565178, now seen corresponding path program 1 times [2018-11-18 15:40:36,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:40:36,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:40:36,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:36,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:40:36,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:36,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:40:36,067 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-18 15:40:36,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:40:36,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:40:36,067 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:40:36,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:40:36,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:40:36,068 INFO L87 Difference]: Start difference. First operand 1225 states and 1693 transitions. cyclomatic complexity: 470 Second operand 3 states. [2018-11-18 15:40:36,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:40:36,419 INFO L93 Difference]: Finished difference Result 1509 states and 2002 transitions. [2018-11-18 15:40:36,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:40:36,419 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1509 states and 2002 transitions. [2018-11-18 15:40:36,424 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1505 [2018-11-18 15:40:36,428 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1509 states to 1509 states and 2002 transitions. [2018-11-18 15:40:36,428 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1509 [2018-11-18 15:40:36,430 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1509 [2018-11-18 15:40:36,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1509 states and 2002 transitions. [2018-11-18 15:40:36,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:40:36,432 INFO L705 BuchiCegarLoop]: Abstraction has 1509 states and 2002 transitions. [2018-11-18 15:40:36,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states and 2002 transitions. [2018-11-18 15:40:36,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1508. [2018-11-18 15:40:36,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1508 states. [2018-11-18 15:40:36,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 2000 transitions. [2018-11-18 15:40:36,445 INFO L728 BuchiCegarLoop]: Abstraction has 1508 states and 2000 transitions. [2018-11-18 15:40:36,445 INFO L608 BuchiCegarLoop]: Abstraction has 1508 states and 2000 transitions. [2018-11-18 15:40:36,445 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 15:40:36,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1508 states and 2000 transitions. [2018-11-18 15:40:36,450 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-18 15:40:36,450 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:40:36,450 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:40:36,451 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 15:40:36,451 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-18 15:40:36,451 INFO L794 eck$LassoCheckResult]: Stem: 6428#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-18 15:40:36,452 INFO L796 eck$LassoCheckResult]: Loop: 6308#L606-3 assume true; 6554#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7650#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);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; 7646#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 7647#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 7641#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 7642#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 7635#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 7636#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 7629#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 7630#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 7654#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 7706#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 7704#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 7702#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 7700#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 7698#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 7696#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 7436#L106 assume (1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0;~a17~0 := 8;~a25~0 := 0;~a19~0 := 0;~a28~0 := 11;~a11~0 := 0;calculate_output_#res := 23; 6539#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 7428#L606-3 assume true; 7426#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7424#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);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; 7422#L30 assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 6530#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 7316#L606-3 assume true; 7314#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7312#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);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; 7310#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 7308#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 7306#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 7304#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 7302#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 7300#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 7298#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 7296#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 7294#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 7293#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 7292#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 7291#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 7289#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 7287#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 7285#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 7283#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 7281#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 7279#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 7277#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 7275#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 7273#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 7271#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 7269#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 7267#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 7265#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 7263#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 7261#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 7259#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 7257#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 7255#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 7253#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 7251#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 7249#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 7247#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 7245#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 7243#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 7241#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 7239#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 7237#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 7235#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 7233#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 7231#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 7229#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 7227#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 7225#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 7223#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 7221#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 6453#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-18 15:40:36,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:40:36,452 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-18 15:40:36,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:40:36,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:40:36,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:36,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:40:36,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:36,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:40:36,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:40:36,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:40:36,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1219893882, now seen corresponding path program 1 times [2018-11-18 15:40:36,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:40:36,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:40:36,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:36,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:40:36,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:36,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:40:36,488 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-18 15:40:36,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:40:36,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:40:36,489 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:40:36,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:40:36,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:40:36,489 INFO L87 Difference]: Start difference. First operand 1508 states and 2000 transitions. cyclomatic complexity: 494 Second operand 3 states. [2018-11-18 15:40:36,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:40:36,800 INFO L93 Difference]: Finished difference Result 1507 states and 1822 transitions. [2018-11-18 15:40:36,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:40:36,801 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1507 states and 1822 transitions. [2018-11-18 15:40:36,805 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-18 15:40:36,808 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1507 states to 1507 states and 1822 transitions. [2018-11-18 15:40:36,809 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1507 [2018-11-18 15:40:36,809 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1507 [2018-11-18 15:40:36,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1507 states and 1822 transitions. [2018-11-18 15:40:36,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:40:36,811 INFO L705 BuchiCegarLoop]: Abstraction has 1507 states and 1822 transitions. [2018-11-18 15:40:36,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states and 1822 transitions. [2018-11-18 15:40:36,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1507. [2018-11-18 15:40:36,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2018-11-18 15:40:36,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1822 transitions. [2018-11-18 15:40:36,824 INFO L728 BuchiCegarLoop]: Abstraction has 1507 states and 1822 transitions. [2018-11-18 15:40:36,824 INFO L608 BuchiCegarLoop]: Abstraction has 1507 states and 1822 transitions. [2018-11-18 15:40:36,824 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 15:40:36,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1507 states and 1822 transitions. [2018-11-18 15:40:36,828 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-18 15:40:36,828 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:40:36,828 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:40:36,829 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 15:40:36,830 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-18 15:40:36,830 INFO L794 eck$LassoCheckResult]: Stem: 9452#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-18 15:40:36,830 INFO L796 eck$LassoCheckResult]: Loop: 9329#L606-3 assume true; 10104#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 10102#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);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; 10100#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 10098#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 10096#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 10094#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 10092#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 10090#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 10088#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 10086#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 10084#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 10082#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 10080#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 10078#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 10076#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 10074#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 10072#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 9921#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 9922#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 10369#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 10367#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 10365#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 10363#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 10362#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 10360#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10358#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 10356#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 10354#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 9781#L165 assume (1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0);~a25~0 := 1;~a28~0 := 9;calculate_output_#res := 26; 9671#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9774#L606-3 assume true; 9772#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 9770#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);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; 9768#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 9766#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 9764#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 9762#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 9760#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 9758#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 9756#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 9754#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 9752#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 9750#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 9748#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 9746#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 9744#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 9742#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 9740#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 9738#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 9736#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 9734#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 9732#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 9730#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 9728#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 9726#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 9724#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 9722#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 9719#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 9717#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 9715#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 9713#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 9711#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 9709#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 9707#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 9705#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 9703#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 9701#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 9699#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 9697#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 9695#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 9693#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 9691#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 9689#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 9687#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 9685#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 9683#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 9681#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 9679#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 9677#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 9673#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 9674#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-18 15:40:36,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:40:36,830 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-18 15:40:36,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:40:36,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:40:36,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:36,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:40:36,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:36,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:40:36,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:40:36,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:40:36,834 INFO L82 PathProgramCache]: Analyzing trace with hash -606648447, now seen corresponding path program 1 times [2018-11-18 15:40:36,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:40:36,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:40:36,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:36,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:40:36,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:36,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:40:36,892 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-18 15:40:36,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:40:36,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:40:36,893 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:40:36,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:40:36,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:40:36,893 INFO L87 Difference]: Start difference. First operand 1507 states and 1822 transitions. cyclomatic complexity: 317 Second operand 3 states. [2018-11-18 15:40:37,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:40:37,081 INFO L93 Difference]: Finished difference Result 1496 states and 1778 transitions. [2018-11-18 15:40:37,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:40:37,082 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1496 states and 1778 transitions. [2018-11-18 15:40:37,086 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-18 15:40:37,089 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1496 states to 1496 states and 1778 transitions. [2018-11-18 15:40:37,089 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1496 [2018-11-18 15:40:37,090 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1496 [2018-11-18 15:40:37,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1496 states and 1778 transitions. [2018-11-18 15:40:37,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:40:37,092 INFO L705 BuchiCegarLoop]: Abstraction has 1496 states and 1778 transitions. [2018-11-18 15:40:37,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states and 1778 transitions. [2018-11-18 15:40:37,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1496. [2018-11-18 15:40:37,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2018-11-18 15:40:37,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 1778 transitions. [2018-11-18 15:40:37,104 INFO L728 BuchiCegarLoop]: Abstraction has 1496 states and 1778 transitions. [2018-11-18 15:40:37,104 INFO L608 BuchiCegarLoop]: Abstraction has 1496 states and 1778 transitions. [2018-11-18 15:40:37,104 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 15:40:37,104 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1496 states and 1778 transitions. [2018-11-18 15:40:37,108 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-18 15:40:37,108 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:40:37,108 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:40:37,109 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 15:40:37,109 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-18 15:40:37,109 INFO L794 eck$LassoCheckResult]: Stem: 12457#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 12337#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 12338#L606-3 [2018-11-18 15:40:37,112 INFO L796 eck$LassoCheckResult]: Loop: 12338#L606-3 assume true; 13071#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 13069#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);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; 13067#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 13060#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 13061#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 13338#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 13336#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 13334#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 13331#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 13330#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 13329#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 13328#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 13327#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 13326#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 13324#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 13322#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 13320#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 13318#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 13316#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 13314#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 13312#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 13310#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 13308#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 13306#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 13304#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13302#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 13300#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 13298#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 13296#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 13294#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 13292#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 13290#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 13288#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 13286#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 13284#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 13282#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 13280#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 13278#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 13276#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 13274#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 13272#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 13270#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 13268#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 13266#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 13264#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 13262#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 13260#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 13258#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 13256#L253 assume !((9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0); 13254#L259 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && (((9 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)); 13252#L261 assume !(9 == ~a17~0 && 1 == ~a21~0 && 1 == ~a11~0 && (3 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a19~0); 13250#L276 assume !(7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 1 == ~a21~0 && 1 == ~a19~0 && 5 == calculate_output_~input && !(1 == ~a11~0)); 13248#L280 assume !(8 == ~a28~0 && 1 == ~a21~0 && (!(1 == ~a11~0) && (1 == calculate_output_~input && 8 == ~a17~0) && 1 == ~a19~0) && 1 == ~a25~0); 13246#L283 assume !((((8 == ~a17~0 && (6 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a21~0) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 13244#L286 assume !((!(1 == ~a11~0) && (!(1 == ~a19~0) && ((!(1 == ~a25~0) && 11 == ~a28~0) || (10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 13242#L291 assume !(8 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a11~0) && 1 == ~a25~0 && 8 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a19~0); 13240#L293 assume !((1 == ~a19~0 && 8 == ~a17~0 && ((!(1 == ~a25~0) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a11~0)) && 11 == ~a28~0); 13238#L297 assume !(1 == ~a11~0 && (9 == ~a17~0 && 9 == ~a28~0 && 1 == ~a19~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 1 == ~a21~0); 13236#L309 assume !((((((3 == calculate_output_~input && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)) && 11 == ~a28~0) && !(1 == ~a11~0)); 13234#L314 assume !(1 == ~a19~0 && 1 == ~a21~0 && ((5 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a11~0) && 9 == ~a17~0); 13232#L328 assume !((1 == ~a19~0 && ((!(1 == ~a11~0) && (1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 10 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0); 13230#L331 assume !((!(1 == ~a11~0) && (((4 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0) && 11 == ~a28~0) && 1 == ~a19~0); 13228#L337 assume !(((!(1 == ~a19~0) && (4 == calculate_output_~input && (((!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 13226#L349 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && ((1 == ~a25~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 11 == ~a28~0) && 1 == ~a21~0); 13224#L354 assume !((((1 == ~a21~0 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (9 == ~a28~0 && 1 == ~a25~0)) && 6 == calculate_output_~input) && !(1 == ~a11~0)) && !(1 == ~a19~0)) && 8 == ~a17~0); 13222#L361 assume !(1 == ~a19~0 && ((1 == ~a21~0 && (!(1 == ~a25~0) && 3 == calculate_output_~input) && 9 == ~a17~0) && 8 == ~a28~0) && 1 == ~a11~0); 13220#L368 assume !(8 == ~a17~0 && (1 == ~a21~0 && (5 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (9 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a19~0) && !(1 == ~a11~0)); 13218#L375 assume !(1 == ~a19~0 && (((8 == ~a17~0 && 5 == calculate_output_~input && !(1 == ~a11~0)) && 1 == ~a21~0) && 1 == ~a25~0) && 8 == ~a28~0); 13216#L378 assume !(((!(1 == ~a11~0) && ((1 == ~a21~0 && 4 == calculate_output_~input) && 10 == ~a28~0) && 8 == ~a17~0) && !(1 == ~a19~0)) && 1 == ~a25~0); 13214#L380 assume !(8 == ~a28~0 && (1 == ~a19~0 && 1 == ~a11~0 && !(1 == ~a25~0) && 9 == ~a17~0 && 6 == calculate_output_~input) && 1 == ~a21~0); 13212#L389 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 6 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a19~0)); 13210#L394 assume !(((((!(1 == ~a25~0) && 1 == ~a19~0 && 3 == calculate_output_~input) && 9 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 13208#L398 assume !((8 == ~a17~0 && ((4 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)); 13206#L402 assume !(((!(1 == ~a11~0) && ((1 == ~a19~0 && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)); 13204#L404 assume !((1 == ~a11~0 && 1 == ~a19~0 && 1 == ~a21~0 && (9 == ~a17~0 && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 8 == ~a28~0); 13202#L407 assume !(!(1 == ~a11~0) && 1 == ~a21~0 && (1 == ~a19~0 && 8 == ~a17~0 && 1 == ~a25~0 && 5 == calculate_output_~input) && 11 == ~a28~0); 13200#L409 assume !(1 == ~a19~0 && 8 == ~a17~0 && ((((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input) && !(1 == ~a11~0)) && 1 == ~a21~0); 13198#L414 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13196#L414-2 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13194#L417-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13192#L420-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13190#L423-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13188#L426-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13186#L429-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13184#L432-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13182#L435-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12354#L438-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13179#L441-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13177#L444-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13175#L447-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13173#L450-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13171#L453-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13169#L456-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13167#L459-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13165#L462-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13163#L465-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13160#L468-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13158#L471-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13156#L474-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13154#L477-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13152#L480-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13150#L483-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13148#L486-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13146#L489-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13144#L492-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13142#L495-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13140#L498-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13138#L501-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13136#L504-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13134#L507-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13132#L510-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13130#L513-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13127#L516-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13125#L519-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13123#L522-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13121#L525-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13119#L528-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13117#L531-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13115#L534-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13113#L537-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13111#L540-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13109#L543-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13107#L546-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13105#L549-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13103#L552-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13102#L555-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13100#L558-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13098#L561-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13096#L564-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13094#L567-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13092#L570-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13090#L573-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13088#L576-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13086#L579-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13084#L582-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13082#L585-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13080#L588-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13078#L591-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13076#L594-1 calculate_output_#res := -2; 13074#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-18 15:40:37,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:40:37,112 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-18 15:40:37,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:40:37,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:40:37,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:37,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:40:37,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:40:37,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:40:37,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:40:37,119 INFO L82 PathProgramCache]: Analyzing trace with hash 245249823, now seen corresponding path program 1 times [2018-11-18 15:40:37,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:40:37,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:40:37,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:37,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:40:37,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:37,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:40:37,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:40:37,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:40:37,162 INFO L82 PathProgramCache]: Analyzing trace with hash -2003304803, now seen corresponding path program 1 times [2018-11-18 15:40:37,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:40:37,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:40:37,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:37,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:40:37,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:37,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:40:37,443 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 26 [2018-11-18 15:40:37,571 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-18 15:40:37,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:40:37,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 15:40:38,230 WARN L180 SmtUtils]: Spent 649.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2018-11-18 15:40:38,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 15:40:38,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-18 15:40:38,297 INFO L87 Difference]: Start difference. First operand 1496 states and 1778 transitions. cyclomatic complexity: 285 Second operand 10 states. [2018-11-18 15:40:39,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:40:39,049 INFO L93 Difference]: Finished difference Result 1688 states and 1967 transitions. [2018-11-18 15:40:39,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 15:40:39,050 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1688 states and 1967 transitions. [2018-11-18 15:40:39,057 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1632 [2018-11-18 15:40:39,063 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1688 states to 1688 states and 1967 transitions. [2018-11-18 15:40:39,063 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1688 [2018-11-18 15:40:39,065 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1688 [2018-11-18 15:40:39,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1688 states and 1967 transitions. [2018-11-18 15:40:39,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:40:39,067 INFO L705 BuchiCegarLoop]: Abstraction has 1688 states and 1967 transitions. [2018-11-18 15:40:39,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states and 1967 transitions. [2018-11-18 15:40:39,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1546. [2018-11-18 15:40:39,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2018-11-18 15:40:39,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 1825 transitions. [2018-11-18 15:40:39,087 INFO L728 BuchiCegarLoop]: Abstraction has 1546 states and 1825 transitions. [2018-11-18 15:40:39,087 INFO L608 BuchiCegarLoop]: Abstraction has 1546 states and 1825 transitions. [2018-11-18 15:40:39,087 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 15:40:39,087 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1546 states and 1825 transitions. [2018-11-18 15:40:39,092 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1490 [2018-11-18 15:40:39,092 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:40:39,092 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:40:39,093 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:40:39,093 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:40:39,093 INFO L794 eck$LassoCheckResult]: Stem: 15662#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; 16729#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16727#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 16725#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 16723#L35 assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res := 22; 15812#L597 [2018-11-18 15:40:39,093 INFO L796 eck$LassoCheckResult]: Loop: 15812#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 16289#L606-3 assume true; 16287#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16285#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);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; 16283#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 16281#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 16279#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 16277#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 16275#L47 assume ((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0;~a25~0 := 0;calculate_output_#res := -1; 15812#L597 [2018-11-18 15:40:39,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:40:39,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1805984299, now seen corresponding path program 1 times [2018-11-18 15:40:39,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:40:39,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:40:39,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:39,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:40:39,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:39,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:40:39,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:40:39,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:40:39,100 INFO L82 PathProgramCache]: Analyzing trace with hash -278812021, now seen corresponding path program 1 times [2018-11-18 15:40:39,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:40:39,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:40:39,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:39,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:40:39,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:39,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:40:39,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:40:39,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:40:39,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1569761375, now seen corresponding path program 1 times [2018-11-18 15:40:39,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:40:39,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:40:39,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:39,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:40:39,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:39,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:40:39,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:40:39,269 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 15:40:39,269 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 15:40:39,269 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 15:40:39,269 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 15:40:39,269 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 15:40:39,270 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:40:39,270 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 15:40:39,270 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 15:40:39,270 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label08_true-unreach-call_false-termination.c_Iteration8_Lasso [2018-11-18 15:40:39,270 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 15:40:39,270 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 15:40:39,271 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-18 15:40:39,279 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-18 15:40:39,280 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-18 15:40:39,281 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-18 15:40:39,283 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-18 15:40:39,284 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-18 15:40:39,287 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-18 15:40:39,288 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-18 15:40:39,290 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-18 15:40:39,292 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-18 15:40:39,293 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-18 15:40:39,294 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-18 15:40:39,295 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-18 15:40:39,297 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-18 15:40:39,298 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-18 15:40:39,300 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-18 15:40:39,306 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-18 15:40:39,307 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-18 15:40:39,312 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-18 15:40:39,314 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-18 15:40:39,316 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-18 15:40:39,430 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 15:40:39,430 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/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-18 15:40:39,433 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 15:40:39,433 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 15:40:39,435 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 15:40:39,435 INFO L448 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_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/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-18 15:40:39,451 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 15:40:39,451 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 15:40:39,453 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 15:40:39,453 INFO L448 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_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/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-18 15:40:39,470 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 15:40:39,470 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 15:40:39,472 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 15:40:39,472 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/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-18 15:40:39,487 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 15:40:39,487 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 15:40:39,490 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 15:40:39,490 INFO L448 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_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/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-18 15:40:39,506 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 15:40:39,506 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 15:40:39,508 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 15:40:39,508 INFO L448 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_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/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-18 15:40:39,525 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 15:40:39,525 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 15:40:39,527 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 15:40:39,527 INFO L448 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_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/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-18 15:40:39,543 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 15:40:39,543 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 15:40:39,545 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 15:40:39,545 INFO L448 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_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/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-18 15:40:39,561 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 15:40:39,561 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 15:40:39,564 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 15:40:39,564 INFO L448 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_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/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-18 15:40:39,583 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 15:40:39,583 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 15:40:39,585 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 15:40:39,585 INFO L448 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_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/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-18 15:40:39,601 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 15:40:39,601 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 15:40:39,603 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 15:40:39,603 INFO L448 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_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/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-18 15:40:39,618 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 15:40:39,618 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 15:40:39,621 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 15:40:39,621 INFO L448 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_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/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-18 15:40:39,637 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 15:40:39,637 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 15:40:39,639 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 15:40:39,639 INFO L448 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_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/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-18 15:40:39,655 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 15:40:39,655 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 15:40:39,662 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 15:40:39,663 INFO L448 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_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/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-18 15:40:39,678 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 15:40:39,678 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 15:40:39,680 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 15:40:39,680 INFO L448 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_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/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-18 15:40:39,696 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 15:40:39,696 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 15:40:39,698 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 15:40:39,698 INFO L448 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_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/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-18 15:40:39,713 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 15:40:39,713 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/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-18 15:40:39,732 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 15:40:39,733 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 15:40:39,895 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 15:40:39,895 INFO L448 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=-6, ULTIMATE.start_calculate_output_~input=2, ULTIMATE.start_main_~input~0=3, ULTIMATE.start_main_#t~nondet2=0}, {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}, {ULTIMATE.start_calculate_output_#in~input=1, ULTIMATE.start_calculate_output_~input=-7, ULTIMATE.start_main_~input~0=-8, ULTIMATE.start_main_#t~nondet2=0}] Lambdas: [0, 11, 0] Nus: [0, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/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-18 15:40:39,911 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 15:40:39,911 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 15:40:39,913 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 15:40:39,913 INFO L448 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_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/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-18 15:40:39,928 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 15:40:39,928 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/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-18 15:40:39,946 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 15:40:39,946 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 15:40:40,082 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 15:40:40,082 INFO L448 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_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/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-18 15:40:40,108 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 15:40:40,108 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 15:40:40,110 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 15:40:40,110 INFO L448 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_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/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-18 15:40:40,125 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 15:40:40,125 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 15:40:40,128 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 15:40:40,128 INFO L448 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_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/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-18 15:40:40,145 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 15:40:40,145 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 15:40:40,147 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 15:40:40,147 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a28~0=0} Honda state: {~a28~0=10} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2018-11-18 15:40:40,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 03:40:40 BoogieIcfgContainer [2018-11-18 15:40:40,185 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 15:40:40,186 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 15:40:40,186 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 15:40:40,186 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 15:40:40,191 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:40:31" (3/4) ... [2018-11-18 15:40:40,194 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-18 15:40:40,233 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_eba5d1c7-637e-4c24-9ae0-13bc5a51b569/bin-2019/uautomizer/witness.graphml [2018-11-18 15:40:40,233 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 15:40:40,234 INFO L168 Benchmark]: Toolchain (without parser) took 10162.16 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 459.3 MB). Free memory was 951.1 MB in the beginning and 1.4 GB in the end (delta: -455.7 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. [2018-11-18 15:40:40,234 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:40:40,235 INFO L168 Benchmark]: CACSL2BoogieTranslator took 365.18 ms. Allocated memory is still 1.0 GB. Free memory was 951.1 MB in the beginning and 918.9 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2018-11-18 15:40:40,235 INFO L168 Benchmark]: Boogie Procedure Inliner took 98.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 918.9 MB in the beginning and 1.1 GB in the end (delta: -193.7 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2018-11-18 15:40:40,235 INFO L168 Benchmark]: Boogie Preprocessor took 41.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 15:40:40,236 INFO L168 Benchmark]: RCFGBuilder took 827.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 997.9 MB in the end (delta: 109.3 MB). Peak memory consumption was 109.3 MB. Max. memory is 11.5 GB. [2018-11-18 15:40:40,236 INFO L168 Benchmark]: BuchiAutomizer took 8779.13 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 339.7 MB). Free memory was 997.9 MB in the beginning and 1.4 GB in the end (delta: -409.2 MB). Peak memory consumption was 508.8 MB. Max. memory is 11.5 GB. [2018-11-18 15:40:40,236 INFO L168 Benchmark]: Witness Printer took 47.65 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 306.5 kB). Peak memory consumption was 306.5 kB. Max. memory is 11.5 GB. [2018-11-18 15:40:40,238 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 365.18 ms. Allocated memory is still 1.0 GB. Free memory was 951.1 MB in the beginning and 918.9 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 98.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 918.9 MB in the beginning and 1.1 GB in the end (delta: -193.7 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 827.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 997.9 MB in the end (delta: 109.3 MB). Peak memory consumption was 109.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8779.13 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 339.7 MB). Free memory was 997.9 MB in the beginning and 1.4 GB in the end (delta: -409.2 MB). Peak memory consumption was 508.8 MB. Max. memory is 11.5 GB. * Witness Printer took 47.65 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 306.5 kB). Peak memory consumption was 306.5 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 8.7s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 5.1s. Construction of modules took 2.2s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 147 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 1546 states and ocurred in iteration 7. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1469 SDtfs, 3081 SDslu, 489 SDs, 0 SdLazy, 3702 SolverSat, 847 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s 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: 64ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 0 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 31 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s - 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@7efbd28c=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@75eeb269=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@7efbd28c=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@75eeb269=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@7efbd28c=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@75eeb269=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 -6*0^k + 1*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 3*0^k + -8*0^k, input=6 + sum_{k=0}^i 2*0^k + -7*0^k} - StatisticsResult: NonterminationArgumentStatistics Unbounded Execution 5GEVs Lambdas: [0, 11, 0, 0, 0, 0] Mus: [0, 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...