./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label41_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3f3c194e-336b-4c54-b7d3-9f08135e7831/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3f3c194e-336b-4c54-b7d3-9f08135e7831/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3f3c194e-336b-4c54-b7d3-9f08135e7831/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3f3c194e-336b-4c54-b7d3-9f08135e7831/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label41_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3f3c194e-336b-4c54-b7d3-9f08135e7831/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3f3c194e-336b-4c54-b7d3-9f08135e7831/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 43cbcba3b52a19a4f3b50b9a2bc823d03105b297 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 02:05:58,739 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 02:05:58,740 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 02:05:58,746 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 02:05:58,747 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 02:05:58,747 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 02:05:58,748 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 02:05:58,749 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 02:05:58,749 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 02:05:58,750 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 02:05:58,750 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 02:05:58,751 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 02:05:58,751 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 02:05:58,751 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 02:05:58,752 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 02:05:58,752 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 02:05:58,753 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 02:05:58,754 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 02:05:58,755 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 02:05:58,756 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 02:05:58,756 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 02:05:58,757 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 02:05:58,758 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 02:05:58,758 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 02:05:58,758 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 02:05:58,759 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 02:05:58,759 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 02:05:58,760 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 02:05:58,760 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 02:05:58,761 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 02:05:58,761 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 02:05:58,761 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 02:05:58,761 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 02:05:58,762 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 02:05:58,762 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 02:05:58,762 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 02:05:58,763 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3f3c194e-336b-4c54-b7d3-9f08135e7831/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-02 02:05:58,771 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 02:05:58,771 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 02:05:58,772 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 02:05:58,772 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 02:05:58,772 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 02:05:58,772 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 02:05:58,773 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 02:05:58,773 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 02:05:58,773 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 02:05:58,773 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 02:05:58,773 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 02:05:58,773 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 02:05:58,773 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 02:05:58,774 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 02:05:58,774 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 02:05:58,774 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 02:05:58,774 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 02:05:58,774 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 02:05:58,774 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 02:05:58,774 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 02:05:58,774 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 02:05:58,775 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 02:05:58,775 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 02:05:58,775 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 02:05:58,775 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 02:05:58,775 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 02:05:58,775 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 02:05:58,775 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 02:05:58,775 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 02:05:58,775 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 02:05:58,775 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 02:05:58,776 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 02:05:58,776 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_3f3c194e-336b-4c54-b7d3-9f08135e7831/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 43cbcba3b52a19a4f3b50b9a2bc823d03105b297 [2018-12-02 02:05:58,794 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 02:05:58,802 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 02:05:58,804 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 02:05:58,806 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 02:05:58,806 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 02:05:58,807 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3f3c194e-336b-4c54-b7d3-9f08135e7831/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label41_true-unreach-call_false-termination.c [2018-12-02 02:05:58,845 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3f3c194e-336b-4c54-b7d3-9f08135e7831/bin-2019/uautomizer/data/54b503b8a/29629de3ed714b2eb0ebc1c0e54c769b/FLAG2c633237e [2018-12-02 02:05:59,286 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 02:05:59,286 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3f3c194e-336b-4c54-b7d3-9f08135e7831/sv-benchmarks/c/eca-rers2012/Problem02_label41_true-unreach-call_false-termination.c [2018-12-02 02:05:59,293 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3f3c194e-336b-4c54-b7d3-9f08135e7831/bin-2019/uautomizer/data/54b503b8a/29629de3ed714b2eb0ebc1c0e54c769b/FLAG2c633237e [2018-12-02 02:05:59,301 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3f3c194e-336b-4c54-b7d3-9f08135e7831/bin-2019/uautomizer/data/54b503b8a/29629de3ed714b2eb0ebc1c0e54c769b [2018-12-02 02:05:59,303 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 02:05:59,304 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 02:05:59,305 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 02:05:59,305 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 02:05:59,307 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 02:05:59,307 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:05:59" (1/1) ... [2018-12-02 02:05:59,309 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ba821c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:05:59, skipping insertion in model container [2018-12-02 02:05:59,309 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:05:59" (1/1) ... [2018-12-02 02:05:59,313 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 02:05:59,336 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 02:05:59,510 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 02:05:59,513 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 02:05:59,600 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 02:05:59,609 INFO L195 MainTranslator]: Completed translation [2018-12-02 02:05:59,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:05:59 WrapperNode [2018-12-02 02:05:59,610 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 02:05:59,610 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 02:05:59,610 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 02:05:59,610 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 02:05:59,616 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:05:59" (1/1) ... [2018-12-02 02:05:59,624 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:05:59" (1/1) ... [2018-12-02 02:05:59,649 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 02:05:59,649 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 02:05:59,650 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 02:05:59,650 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 02:05:59,655 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:05:59" (1/1) ... [2018-12-02 02:05:59,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:05:59" (1/1) ... [2018-12-02 02:05:59,657 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:05:59" (1/1) ... [2018-12-02 02:05:59,658 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:05:59" (1/1) ... [2018-12-02 02:05:59,666 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:05:59" (1/1) ... [2018-12-02 02:05:59,672 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:05:59" (1/1) ... [2018-12-02 02:05:59,674 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:05:59" (1/1) ... [2018-12-02 02:05:59,677 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 02:05:59,678 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 02:05:59,678 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 02:05:59,678 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 02:05:59,678 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:05:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f3c194e-336b-4c54-b7d3-9f08135e7831/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-12-02 02:05:59,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 02:05:59,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 02:06:00,314 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 02:06:00,314 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-02 02:06:00,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:06:00 BoogieIcfgContainer [2018-12-02 02:06:00,315 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 02:06:00,315 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 02:06:00,315 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 02:06:00,318 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 02:06:00,319 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 02:06:00,319 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 02:05:59" (1/3) ... [2018-12-02 02:06:00,320 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6cb2f447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 02:06:00, skipping insertion in model container [2018-12-02 02:06:00,320 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 02:06:00,320 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:05:59" (2/3) ... [2018-12-02 02:06:00,321 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6cb2f447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 02:06:00, skipping insertion in model container [2018-12-02 02:06:00,321 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 02:06:00,321 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:06:00" (3/3) ... [2018-12-02 02:06:00,322 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label41_true-unreach-call_false-termination.c [2018-12-02 02:06:00,366 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 02:06:00,367 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 02:06:00,367 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 02:06:00,367 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 02:06:00,367 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 02:06:00,367 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 02:06:00,367 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 02:06:00,368 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 02:06:00,368 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 02:06:00,385 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2018-12-02 02:06:00,411 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2018-12-02 02:06:00,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 02:06:00,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 02:06:00,419 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 02:06:00,419 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 02:06:00,419 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 02:06:00,419 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2018-12-02 02:06:00,425 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2018-12-02 02:06:00,425 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 02:06:00,425 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 02:06:00,426 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 02:06:00,426 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 02:06:00,432 INFO L794 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRYtrue ~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 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 164#L606-2true [2018-12-02 02:06:00,432 INFO L796 eck$LassoCheckResult]: Loop: 164#L606-2true 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);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 191#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; 206#L597true main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 164#L606-2true [2018-12-02 02:06:00,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:06:00,436 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-02 02:06:00,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:06:00,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:06:00,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:06:00,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:06:00,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:06:00,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:06:00,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:06:00,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:06:00,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1268139, now seen corresponding path program 1 times [2018-12-02 02:06:00,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:06:00,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:06:00,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:06:00,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:06:00,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:06:00,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:06:00,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:06:00,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:06:00,521 INFO L82 PathProgramCache]: Analyzing trace with hash 889695341, now seen corresponding path program 1 times [2018-12-02 02:06:00,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:06:00,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:06:00,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:06:00,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:06:00,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:06:00,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:06:00,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:06:00,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:06:00,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 02:06:00,670 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 02:06:00,671 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 02:06:00,671 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 02:06:00,671 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 02:06:00,671 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 02:06:00,671 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 02:06:00,671 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 02:06:00,671 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 02:06:00,671 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label41_true-unreach-call_false-termination.c_Iteration1_Loop [2018-12-02 02:06:00,672 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 02:06:00,672 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 02:06:00,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:06:00,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:06:00,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:06:00,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:06:00,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:06:00,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:06:00,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:06:00,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:06:00,891 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 02:06:00,891 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f3c194e-336b-4c54-b7d3-9f08135e7831/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-12-02 02:06:00,895 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 02:06:00,895 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 02:06:00,900 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 02:06:00,900 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_3f3c194e-336b-4c54-b7d3-9f08135e7831/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-12-02 02:06:00,916 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 02:06:00,916 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 02:06:00,921 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 02:06:00,921 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_3f3c194e-336b-4c54-b7d3-9f08135e7831/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-12-02 02:06:00,945 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 02:06:00,945 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 02:06:00,948 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 02:06:00,948 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_3f3c194e-336b-4c54-b7d3-9f08135e7831/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-12-02 02:06:00,963 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 02:06:00,964 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 02:06:00,966 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 02:06:00,966 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_3f3c194e-336b-4c54-b7d3-9f08135e7831/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-12-02 02:06:00,981 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 02:06:00,981 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 02:06:00,984 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 02:06:00,984 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_3f3c194e-336b-4c54-b7d3-9f08135e7831/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-12-02 02:06:00,999 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 02:06:00,999 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 02:06:01,002 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 02:06:01,002 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_3f3c194e-336b-4c54-b7d3-9f08135e7831/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-12-02 02:06:01,026 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 02:06:01,026 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 02:06:01,031 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 02:06:01,031 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_3f3c194e-336b-4c54-b7d3-9f08135e7831/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-12-02 02:06:01,045 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 02:06:01,046 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f3c194e-336b-4c54-b7d3-9f08135e7831/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-12-02 02:06:01,065 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 02:06:01,065 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 02:06:01,086 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 02:06:01,087 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 02:06:01,087 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 02:06:01,087 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 02:06:01,087 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 02:06:01,087 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 02:06:01,087 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 02:06:01,088 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 02:06:01,088 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 02:06:01,088 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label41_true-unreach-call_false-termination.c_Iteration1_Loop [2018-12-02 02:06:01,088 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 02:06:01,088 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 02:06:01,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:06:01,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:06:01,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:06:01,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:06:01,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:06:01,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:06:01,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:06:01,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:06:01,282 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 02:06:01,285 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 02:06:01,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:01,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:06:01,290 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:06:01,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,296 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:01,297 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:06:01,298 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:06:01,298 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:01,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,300 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-02 02:06:01,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:06:01,302 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:06:01,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:01,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:06:01,317 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:06:01,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,319 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:01,320 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:06:01,320 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:06:01,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:01,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:06:01,324 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:06:01,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,325 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:01,326 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:06:01,326 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:06:01,326 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:01,328 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,328 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 02:06:01,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:06:01,328 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 02:06:01,329 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,332 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-12-02 02:06:01,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:01,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,333 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 02:06:01,334 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 02:06:01,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,338 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:01,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,340 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 02:06:01,340 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 02:06:01,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:01,342 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,343 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-02 02:06:01,343 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 02:06:01,344 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 02:06:01,344 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,355 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:01,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,356 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 02:06:01,356 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 02:06:01,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,359 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:01,359 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,360 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 02:06:01,360 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 02:06:01,360 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,362 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:01,362 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,363 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 02:06:01,363 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 02:06:01,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:01,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,386 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 02:06:01,387 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 02:06:01,387 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:01,389 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,389 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 02:06:01,389 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 02:06:01,389 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:06:01,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,393 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-12-02 02:06:01,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:01,393 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,394 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 02:06:01,394 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 02:06:01,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:01,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,399 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 02:06:01,399 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 02:06:01,399 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:01,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,402 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-02 02:06:01,402 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 02:06:01,403 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 02:06:01,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,412 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:01,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,412 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 02:06:01,413 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 02:06:01,413 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:01,415 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,416 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 02:06:01,416 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 02:06:01,416 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:01,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,418 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 02:06:01,418 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 02:06:01,418 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:01,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,420 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 02:06:01,421 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 02:06:01,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:01,422 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,422 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 02:06:01,422 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 02:06:01,423 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 02:06:01,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,425 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-12-02 02:06:01,426 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:01,426 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,426 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 02:06:01,427 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 02:06:01,427 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,430 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,431 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:01,431 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,431 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 02:06:01,432 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 02:06:01,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,433 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:01,434 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,434 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-02 02:06:01,434 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 02:06:01,435 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-02 02:06:01,435 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,443 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,443 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:01,444 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,444 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 02:06:01,445 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 02:06:01,445 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,446 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,447 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:01,447 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,447 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 02:06:01,448 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 02:06:01,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,449 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,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-12-02 02:06:01,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:01,449 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,449 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 02:06:01,450 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 02:06:01,450 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,451 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,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-12-02 02:06:01,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:01,452 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,452 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 02:06:01,452 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 02:06:01,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,453 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:01,453 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,453 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 02:06:01,453 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 02:06:01,454 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-02 02:06:01,454 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,456 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-12-02 02:06:01,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-12-02 02:06:01,457 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:01,457 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 02:06:01,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,457 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 02:06:01,458 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 02:06:01,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,465 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,466 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:01,466 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 02:06:01,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,466 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 02:06:01,466 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 02:06:01,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,468 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,469 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:01,469 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 02:06:01,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,469 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-02 02:06:01,469 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 02:06:01,470 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-02 02:06:01,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,487 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:01,487 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 02:06:01,487 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,487 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 02:06:01,487 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 02:06:01,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,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-12-02 02:06:01,491 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:01,491 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 02:06:01,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,491 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 02:06:01,491 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 02:06:01,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,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-12-02 02:06:01,494 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:01,494 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 02:06:01,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,494 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 02:06:01,494 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 02:06:01,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,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-12-02 02:06:01,496 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:01,496 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 02:06:01,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,497 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 02:06:01,497 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 02:06:01,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,498 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,498 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:01,498 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 02:06:01,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,498 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 02:06:01,498 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 02:06:01,499 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:06:01,499 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,502 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-12-02 02:06:01,502 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,502 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:01,503 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 02:06:01,503 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,503 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 02:06:01,504 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 02:06:01,504 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,511 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:01,511 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 02:06:01,512 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,512 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 02:06:01,512 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 02:06:01,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,514 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,515 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:01,515 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 02:06:01,515 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,515 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-02 02:06:01,515 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 02:06:01,517 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 02:06:01,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,534 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,535 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:01,535 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 02:06:01,535 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,535 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 02:06:01,536 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 02:06:01,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,539 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,539 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:01,540 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 02:06:01,540 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,540 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 02:06:01,540 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 02:06:01,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,543 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:01,543 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 02:06:01,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,543 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 02:06:01,544 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 02:06:01,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,546 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:01,546 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 02:06:01,546 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,547 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 02:06:01,547 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 02:06:01,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,548 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:01,548 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 02:06:01,549 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,549 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 02:06:01,549 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 02:06:01,549 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 02:06:01,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,554 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-12-02 02:06:01,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,555 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:01,555 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 02:06:01,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,555 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 02:06:01,556 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 02:06:01,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,564 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:01,564 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 02:06:01,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,564 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 02:06:01,564 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 02:06:01,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,568 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:01,568 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 02:06:01,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,568 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-02 02:06:01,568 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 02:06:01,571 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-02 02:06:01,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,593 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,594 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:01,594 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 02:06:01,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,594 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 02:06:01,595 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 02:06:01,595 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,600 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:01,600 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 02:06:01,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,600 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 02:06:01,601 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 02:06:01,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,603 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,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-12-02 02:06:01,604 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:01,604 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 02:06:01,604 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,604 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 02:06:01,605 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 02:06:01,605 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,607 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,608 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:01,608 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 02:06:01,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,608 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 02:06:01,609 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 02:06:01,609 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,609 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,610 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:01,610 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 02:06:01,610 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,610 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 02:06:01,610 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 02:06:01,611 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-02 02:06:01,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,617 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-12-02 02:06:01,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,617 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:01,618 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 02:06:01,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,618 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 02:06:01,618 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 02:06:01,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,625 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:01,625 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 02:06:01,625 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,625 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 02:06:01,625 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 02:06:01,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,627 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,627 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:01,627 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 02:06:01,627 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,627 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-02 02:06:01,627 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 02:06:01,628 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 02:06:01,628 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,638 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,639 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:01,639 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 02:06:01,639 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,639 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 02:06:01,639 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 02:06:01,640 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,642 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,642 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:01,642 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 02:06:01,642 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,643 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 02:06:01,643 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 02:06:01,643 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,644 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:01,645 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 02:06:01,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,645 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 02:06:01,645 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 02:06:01,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,646 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:01,647 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 02:06:01,647 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,647 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 02:06:01,647 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 02:06:01,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,648 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,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-12-02 02:06:01,648 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:01,648 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 02:06:01,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,648 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 02:06:01,649 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 02:06:01,649 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 02:06:01,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,653 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-12-02 02:06:01,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,653 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:01,653 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 02:06:01,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,653 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 02:06:01,654 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:06:01,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,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-12-02 02:06:01,673 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:01,673 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 02:06:01,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,673 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 02:06:01,673 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:06:01,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,675 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,676 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:01,676 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 02:06:01,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,676 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-02 02:06:01,676 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 02:06:01,677 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-12-02 02:06:01,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,726 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:01,726 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 02:06:01,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,726 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 02:06:01,727 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:06:01,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,732 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:01,732 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 02:06:01,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,732 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 02:06:01,733 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:06:01,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,735 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:01,735 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 02:06:01,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,735 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 02:06:01,735 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:06:01,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:01,738 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:01,738 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 02:06:01,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:01,738 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 02:06:01,738 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:06:01,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,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-12-02 02:06:01,740 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:01,740 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 02:06:01,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:01,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:01,741 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 02:06:01,741 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 02:06:01,741 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 02:06:01,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:01,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:01,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:06:01,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:06:01,757 INFO L87 Difference]: Start difference. First operand 226 states. Second operand 3 states. [2018-12-02 02:06:02,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:06:02,182 INFO L93 Difference]: Finished difference Result 379 states and 480 transitions. [2018-12-02 02:06:02,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:06:02,184 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 379 states and 480 transitions. [2018-12-02 02:06:02,187 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 304 [2018-12-02 02:06:02,190 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 379 states to 306 states and 407 transitions. [2018-12-02 02:06:02,191 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 306 [2018-12-02 02:06:02,191 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 306 [2018-12-02 02:06:02,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 306 states and 407 transitions. [2018-12-02 02:06:02,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 02:06:02,193 INFO L705 BuchiCegarLoop]: Abstraction has 306 states and 407 transitions. [2018-12-02 02:06:02,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states and 407 transitions. [2018-12-02 02:06:02,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2018-12-02 02:06:02,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-12-02 02:06:02,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 405 transitions. [2018-12-02 02:06:02,217 INFO L728 BuchiCegarLoop]: Abstraction has 305 states and 405 transitions. [2018-12-02 02:06:02,217 INFO L608 BuchiCegarLoop]: Abstraction has 305 states and 405 transitions. [2018-12-02 02:06:02,217 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 02:06:02,217 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 305 states and 405 transitions. [2018-12-02 02:06:02,218 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 303 [2018-12-02 02:06:02,218 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 02:06:02,218 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 02:06:02,218 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 02:06:02,218 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:06:02,218 INFO L794 eck$LassoCheckResult]: Stem: 764#ULTIMATE.startENTRY ~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; 635#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 636#L606-2 [2018-12-02 02:06:02,219 INFO L796 eck$LassoCheckResult]: Loop: 636#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 721#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 752#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); 758#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 789#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); 713#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 714#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); 707#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 638#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; 639#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 636#L606-2 [2018-12-02 02:06:02,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:06:02,219 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-12-02 02:06:02,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:06:02,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:06:02,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:06:02,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:06:02,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:06:02,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:06:02,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:06:02,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:06:02,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1948456188, now seen corresponding path program 1 times [2018-12-02 02:06:02,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:06:02,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:06:02,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:06:02,224 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:06:02,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:06:02,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:06:02,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:06:02,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:06:02,231 INFO L82 PathProgramCache]: Analyzing trace with hash -141898178, now seen corresponding path program 1 times [2018-12-02 02:06:02,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:06:02,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:06:02,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:06:02,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:06:02,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:06:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:06:02,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:06:02,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:06:02,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 02:06:02,334 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 02:06:02,334 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 02:06:02,334 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 02:06:02,334 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 02:06:02,335 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 02:06:02,335 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 02:06:02,335 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 02:06:02,335 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 02:06:02,335 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label41_true-unreach-call_false-termination.c_Iteration2_Loop [2018-12-02 02:06:02,335 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 02:06:02,335 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 02:06:02,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:06:02,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:06:02,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-12-02 02:06:02,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:06:02,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:06:02,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:06:02,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:06:02,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:06:02,435 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 02:06:02,436 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f3c194e-336b-4c54-b7d3-9f08135e7831/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-12-02 02:06:02,439 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 02:06:02,439 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 02:06:02,441 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 02:06:02,441 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_3f3c194e-336b-4c54-b7d3-9f08135e7831/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-12-02 02:06:02,456 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 02:06:02,456 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 02:06:02,459 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 02:06:02,459 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_3f3c194e-336b-4c54-b7d3-9f08135e7831/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-12-02 02:06:02,474 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 02:06:02,475 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 02:06:02,477 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 02:06:02,477 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_3f3c194e-336b-4c54-b7d3-9f08135e7831/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-12-02 02:06:02,497 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 02:06:02,497 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 02:06:02,499 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 02:06:02,499 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_3f3c194e-336b-4c54-b7d3-9f08135e7831/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-12-02 02:06:02,515 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 02:06:02,515 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 02:06:02,517 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 02:06:02,517 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_3f3c194e-336b-4c54-b7d3-9f08135e7831/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-12-02 02:06:02,532 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 02:06:02,532 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f3c194e-336b-4c54-b7d3-9f08135e7831/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-12-02 02:06:02,550 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 02:06:02,550 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 02:06:02,570 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 02:06:02,572 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 02:06:02,572 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 02:06:02,572 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 02:06:02,572 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 02:06:02,572 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 02:06:02,572 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 02:06:02,572 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 02:06:02,572 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 02:06:02,573 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label41_true-unreach-call_false-termination.c_Iteration2_Loop [2018-12-02 02:06:02,573 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 02:06:02,573 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 02:06:02,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:06:02,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:06:02,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:06:02,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:06:02,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:06:02,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:06:02,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:06:02,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:06:02,697 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 02:06:02,697 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 02:06:02,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:02,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:02,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:06:02,699 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:06:02,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:02,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,701 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 02:06:02,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:06:02,701 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 02:06:02,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:02,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:02,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:06:02,703 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:06:02,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,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-12-02 02:06:02,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:02,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:02,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:06:02,705 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:06:02,705 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,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-12-02 02:06:02,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:02,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,706 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 02:06:02,706 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:06:02,707 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 02:06:02,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,709 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:02,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,709 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 02:06:02,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:06:02,710 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 02:06:02,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:02,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:02,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:06:02,714 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:06:02,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:02,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:02,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 02:06:02,717 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 02:06:02,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,718 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-12-02 02:06:02,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:02,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:02,719 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 02:06:02,719 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 02:06:02,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:02,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,721 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 02:06:02,721 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 02:06:02,721 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:06:02,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:02,784 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:02,785 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 02:06:02,786 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 02:06:02,786 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,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-12-02 02:06:02,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:02,787 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:02,787 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 02:06:02,787 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 02:06:02,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:02,788 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,788 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 02:06:02,788 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 02:06:02,789 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:06:02,789 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,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-12-02 02:06:02,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:02,790 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,790 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 02:06:02,791 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 02:06:02,791 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:06:02,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:02,793 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:02,793 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 02:06:02,794 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 02:06:02,794 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:02,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:02,796 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 02:06:02,796 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 02:06:02,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,797 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-12-02 02:06:02,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-12-02 02:06:02,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:02,798 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:02,798 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 02:06:02,798 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 02:06:02,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,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-12-02 02:06:02,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:02,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,799 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 02:06:02,800 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 02:06:02,800 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 02:06:02,800 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,800 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:02,801 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:02,801 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 02:06:02,801 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 02:06:02,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:02,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:02,802 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 02:06:02,803 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 02:06:02,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,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-12-02 02:06:02,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:02,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,804 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 02:06:02,804 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 02:06:02,805 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 02:06:02,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:02,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,807 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 02:06:02,807 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 02:06:02,807 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 02:06:02,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:02,810 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:02,810 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 02:06:02,811 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 02:06:02,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,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-12-02 02:06:02,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:02,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:02,813 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 02:06:02,813 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 02:06:02,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,814 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-12-02 02:06:02,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:02,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:02,815 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 02:06:02,815 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 02:06:02,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,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-12-02 02:06:02,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:02,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,817 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 02:06:02,817 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 02:06:02,817 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-02 02:06:02,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,818 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:02,818 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:02,818 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 02:06:02,819 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 02:06:02,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:02,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:02,820 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 02:06:02,820 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 02:06:02,820 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,821 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,821 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:02,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,821 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 02:06:02,822 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 02:06:02,822 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-02 02:06:02,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,824 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:02,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,824 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 02:06:02,825 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 02:06:02,825 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-02 02:06:02,825 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:02,829 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:02,829 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 02:06:02,830 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 02:06:02,830 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 02:06:02,833 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:02,833 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 02:06:02,834 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 02:06:02,834 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,836 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-12-02 02:06:02,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,836 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:02,836 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 02:06:02,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:02,836 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 02:06:02,837 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 02:06:02,837 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,838 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:02,839 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 02:06:02,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,839 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 02:06:02,839 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 02:06:02,839 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:06:02,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,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-12-02 02:06:02,840 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:02,840 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 02:06:02,840 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:02,840 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 02:06:02,841 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 02:06:02,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,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-12-02 02:06:02,842 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:02,842 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 02:06:02,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:02,842 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 02:06:02,842 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 02:06:02,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,844 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,844 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:02,844 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 02:06:02,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,844 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 02:06:02,844 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 02:06:02,845 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:06:02,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,847 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,847 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:02,847 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 02:06:02,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,848 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 02:06:02,848 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 02:06:02,848 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:06:02,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,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-12-02 02:06:02,852 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:02,853 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 02:06:02,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:02,853 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 02:06:02,853 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 02:06:02,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,857 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,857 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:02,858 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 02:06:02,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:02,858 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 02:06:02,858 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 02:06:02,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,860 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-12-02 02:06:02,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,860 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:02,860 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 02:06:02,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:02,860 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 02:06:02,861 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 02:06:02,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,863 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:02,863 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 02:06:02,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,863 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 02:06:02,863 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 02:06:02,864 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 02:06:02,864 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,865 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:02,865 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 02:06:02,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:02,865 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 02:06:02,865 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 02:06:02,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,866 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,866 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:02,866 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 02:06:02,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:02,866 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 02:06:02,867 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 02:06:02,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,868 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,869 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:02,869 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 02:06:02,869 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,869 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 02:06:02,869 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 02:06:02,870 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 02:06:02,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,873 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,873 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:02,873 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 02:06:02,873 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,874 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 02:06:02,874 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 02:06:02,875 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 02:06:02,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,881 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,881 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:02,881 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 02:06:02,881 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:02,881 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 02:06:02,882 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 02:06:02,882 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,886 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:02,886 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 02:06:02,886 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:02,886 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 02:06:02,887 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 02:06:02,887 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,889 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-12-02 02:06:02,889 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,890 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:02,890 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 02:06:02,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:02,890 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 02:06:02,891 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 02:06:02,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,893 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:02,893 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 02:06:02,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,894 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 02:06:02,894 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 02:06:02,894 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-02 02:06:02,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,896 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:02,896 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 02:06:02,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:02,896 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 02:06:02,896 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 02:06:02,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,897 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:02,897 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 02:06:02,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:02,898 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 02:06:02,898 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 02:06:02,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,901 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:02,901 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 02:06:02,901 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,901 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 02:06:02,901 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 02:06:02,902 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-02 02:06:02,902 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,908 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:02,908 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 02:06:02,908 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,908 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 02:06:02,908 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 02:06:02,910 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-02 02:06:02,910 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,920 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:02,920 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 02:06:02,920 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:02,921 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 02:06:02,922 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 02:06:02,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,927 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,927 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:02,928 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 02:06:02,928 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:02,928 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 02:06:02,929 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 02:06:02,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,932 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,932 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-12-02 02:06:02,932 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,933 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:02,933 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 02:06:02,933 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:02,933 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 02:06:02,933 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 02:06:02,933 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,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-12-02 02:06:02,935 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:02,935 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 02:06:02,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,935 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 02:06:02,935 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 02:06:02,935 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 02:06:02,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,937 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:02,937 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 02:06:02,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:02,937 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 02:06:02,937 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 02:06:02,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,938 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,938 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:02,938 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 02:06:02,938 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:02,939 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 02:06:02,939 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 02:06:02,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,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-12-02 02:06:02,940 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:02,940 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 02:06:02,940 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,940 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 02:06:02,940 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 02:06:02,941 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 02:06:02,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,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-12-02 02:06:02,944 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:02,944 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 02:06:02,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,944 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 02:06:02,944 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 02:06:02,944 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 02:06:02,944 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,948 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,949 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:02,949 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 02:06:02,949 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:02,949 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 02:06:02,949 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 02:06:02,949 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,953 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,954 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:02,954 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 02:06:02,954 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:02,954 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 02:06:02,954 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 02:06:02,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,956 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,956 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-12-02 02:06:02,956 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,957 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:02,957 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 02:06:02,957 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:02,957 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 02:06:02,957 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:06:02,957 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,959 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,959 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,959 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:02,959 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 02:06:02,959 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,959 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 02:06:02,959 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 02:06:02,960 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 02:06:02,960 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,961 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,961 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:02,961 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 02:06:02,961 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:02,961 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 02:06:02,962 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:06:02,962 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,963 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,963 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,963 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:02,963 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 02:06:02,963 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:02,963 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 02:06:02,964 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:06:02,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,965 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,965 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:02,965 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 02:06:02,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,966 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 02:06:02,966 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 02:06:02,966 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 02:06:02,966 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,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-12-02 02:06:02,973 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:02,973 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 02:06:02,973 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,974 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 02:06:02,974 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 02:06:02,975 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 02:06:02,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,985 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,985 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:02,985 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 02:06:02,985 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:02,985 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 02:06:02,986 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:06:02,986 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,995 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:02,995 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 02:06:02,995 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 02:06:02,995 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 02:06:02,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 02:06:02,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 02:06:02,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 02:06:02,996 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 02:06:02,996 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 02:06:02,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 02:06:02,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 02:06:03,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:06:03,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:06:03,000 INFO L87 Difference]: Start difference. First operand 305 states and 405 transitions. cyclomatic complexity: 101 Second operand 3 states. [2018-12-02 02:06:03,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:06:03,297 INFO L93 Difference]: Finished difference Result 590 states and 749 transitions. [2018-12-02 02:06:03,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:06:03,298 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 590 states and 749 transitions. [2018-12-02 02:06:03,300 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2018-12-02 02:06:03,302 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 590 states to 590 states and 749 transitions. [2018-12-02 02:06:03,302 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 590 [2018-12-02 02:06:03,303 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 590 [2018-12-02 02:06:03,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 590 states and 749 transitions. [2018-12-02 02:06:03,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 02:06:03,304 INFO L705 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2018-12-02 02:06:03,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states and 749 transitions. [2018-12-02 02:06:03,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2018-12-02 02:06:03,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-12-02 02:06:03,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 749 transitions. [2018-12-02 02:06:03,314 INFO L728 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2018-12-02 02:06:03,314 INFO L608 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2018-12-02 02:06:03,314 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 02:06:03,314 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 590 states and 749 transitions. [2018-12-02 02:06:03,316 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2018-12-02 02:06:03,316 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 02:06:03,316 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 02:06:03,316 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 02:06:03,317 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [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-12-02 02:06:03,317 INFO L794 eck$LassoCheckResult]: Stem: 1666#ULTIMATE.startENTRY ~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; 1539#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 1540#L606-2 [2018-12-02 02:06:03,317 INFO L796 eck$LassoCheckResult]: Loop: 1540#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1627#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 1657#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); 1663#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; 1536#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1898#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1894#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 1890#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); 1695#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 1674#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); 1675#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 1848#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); 1844#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 1840#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)); 1836#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); 1832#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); 1828#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); 1824#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 1820#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); 1815#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 1814#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 1745#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 1746#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); 1806#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); 1805#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 1804#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); 1803#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 1743#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 1744#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); 1797#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 1793#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); 1788#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); 1787#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 1786#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 1784#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 1782#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 1777#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); 1774#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 1773#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 1772#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 1771#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); 1769#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 1767#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 1708#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); 1709#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 1872#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); 1868#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); 1864#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 1862#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); 1861#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 1859#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 1857#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)); 1855#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); 1853#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; 1679#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1540#L606-2 [2018-12-02 02:06:03,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:06:03,317 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-12-02 02:06:03,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:06:03,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:06:03,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:06:03,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:06:03,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:06:03,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:06:03,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:06:03,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:06:03,321 INFO L82 PathProgramCache]: Analyzing trace with hash -695559695, now seen corresponding path program 1 times [2018-12-02 02:06:03,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:06:03,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:06:03,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:06:03,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:06:03,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:06:03,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:06:03,363 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:06:03,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:06:03,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 02:06:03,364 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 02:06:03,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 02:06:03,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 02:06:03,364 INFO L87 Difference]: Start difference. First operand 590 states and 749 transitions. cyclomatic complexity: 160 Second operand 4 states. [2018-12-02 02:06:03,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:06:03,829 INFO L93 Difference]: Finished difference Result 1154 states and 1436 transitions. [2018-12-02 02:06:03,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 02:06:03,829 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1154 states and 1436 transitions. [2018-12-02 02:06:03,833 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1150 [2018-12-02 02:06:03,836 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1154 states to 1154 states and 1436 transitions. [2018-12-02 02:06:03,836 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1154 [2018-12-02 02:06:03,837 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1154 [2018-12-02 02:06:03,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1154 states and 1436 transitions. [2018-12-02 02:06:03,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 02:06:03,838 INFO L705 BuchiCegarLoop]: Abstraction has 1154 states and 1436 transitions. [2018-12-02 02:06:03,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states and 1436 transitions. [2018-12-02 02:06:03,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1151. [2018-12-02 02:06:03,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151 states. [2018-12-02 02:06:03,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1430 transitions. [2018-12-02 02:06:03,851 INFO L728 BuchiCegarLoop]: Abstraction has 1151 states and 1430 transitions. [2018-12-02 02:06:03,851 INFO L608 BuchiCegarLoop]: Abstraction has 1151 states and 1430 transitions. [2018-12-02 02:06:03,851 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 02:06:03,851 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1151 states and 1430 transitions. [2018-12-02 02:06:03,854 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1147 [2018-12-02 02:06:03,854 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 02:06:03,854 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 02:06:03,855 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 02:06:03,855 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [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-12-02 02:06:03,855 INFO L794 eck$LassoCheckResult]: Stem: 3434#ULTIMATE.startENTRY ~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; 3291#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 3292#L606-2 [2018-12-02 02:06:03,855 INFO L796 eck$LassoCheckResult]: Loop: 3292#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3683#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 3682#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); 3681#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 3680#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); 3679#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3678#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); 3677#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; 3288#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3909#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3904#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 3892#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; 3338#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3875#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3872#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 3869#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); 3866#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 3863#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); 3859#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3857#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); 3856#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 3855#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)); 3850#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); 3849#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); 3848#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); 3847#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 3845#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); 3843#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 3841#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 3839#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 3837#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); 3835#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); 3833#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 3831#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); 3829#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 3827#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 3825#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); 3823#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 3821#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); 3819#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); 3817#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 3815#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 3813#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 3811#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 3809#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); 3807#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 3805#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3803#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 3801#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); 3799#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 3797#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 3795#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); 3793#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 3791#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); 3789#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); 3787#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 3785#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); 3783#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 3781#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 3779#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)); 3772#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); 3685#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; 3684#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3292#L606-2 [2018-12-02 02:06:03,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:06:03,856 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-12-02 02:06:03,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:06:03,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:06:03,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:06:03,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:06:03,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:06:03,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:06:03,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:06:03,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:06:03,859 INFO L82 PathProgramCache]: Analyzing trace with hash -917902191, now seen corresponding path program 1 times [2018-12-02 02:06:03,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:06:03,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:06:03,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:06:03,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:06:03,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:06:03,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:06:03,872 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 02:06:03,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:06:03,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:06:03,872 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 02:06:03,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:06:03,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:06:03,873 INFO L87 Difference]: Start difference. First operand 1151 states and 1430 transitions. cyclomatic complexity: 281 Second operand 3 states. [2018-12-02 02:06:04,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:06:04,171 INFO L93 Difference]: Finished difference Result 1291 states and 1575 transitions. [2018-12-02 02:06:04,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:06:04,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1291 states and 1575 transitions. [2018-12-02 02:06:04,175 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2018-12-02 02:06:04,178 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1291 states to 1291 states and 1575 transitions. [2018-12-02 02:06:04,178 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1291 [2018-12-02 02:06:04,178 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1291 [2018-12-02 02:06:04,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1291 states and 1575 transitions. [2018-12-02 02:06:04,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 02:06:04,179 INFO L705 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2018-12-02 02:06:04,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states and 1575 transitions. [2018-12-02 02:06:04,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1291. [2018-12-02 02:06:04,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1291 states. [2018-12-02 02:06:04,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1575 transitions. [2018-12-02 02:06:04,189 INFO L728 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2018-12-02 02:06:04,189 INFO L608 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2018-12-02 02:06:04,189 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 02:06:04,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1291 states and 1575 transitions. [2018-12-02 02:06:04,192 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2018-12-02 02:06:04,193 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 02:06:04,193 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 02:06:04,193 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 02:06:04,193 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [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-12-02 02:06:04,194 INFO L794 eck$LassoCheckResult]: Stem: 5882#ULTIMATE.startENTRY ~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; 5738#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 5739#L606-2 [2018-12-02 02:06:04,194 INFO L796 eck$LassoCheckResult]: Loop: 5739#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6148#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6147#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); 6146#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 6145#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); 6144#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6143#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); 6142#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 6141#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)); 6140#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); 6139#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); 6138#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); 6137#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 6136#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); 6135#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 6134#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 6133#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 6132#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; 5812#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6335#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6332#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6329#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; 5786#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6333#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6330#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6327#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); 6324#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 6321#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); 6318#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6316#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); 6315#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 6314#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)); 6313#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); 6312#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); 6311#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); 6310#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 6309#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); 6307#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 6305#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 6303#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 6301#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); 6299#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); 6297#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 6295#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); 6293#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 6291#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 6289#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); 6287#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 6285#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); 6283#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); 6281#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 6279#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 6277#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 6275#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 6273#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); 6271#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 6269#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6267#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 6265#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); 6263#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 6261#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 6259#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); 6257#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6255#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); 6253#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); 6250#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 6248#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); 6246#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 6244#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 6241#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)); 6236#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); 6150#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; 6149#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 5739#L606-2 [2018-12-02 02:06:04,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:06:04,194 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-12-02 02:06:04,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:06:04,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:06:04,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:06:04,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:06:04,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:06:04,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:06:04,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:06:04,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:06:04,197 INFO L82 PathProgramCache]: Analyzing trace with hash -925782543, now seen corresponding path program 1 times [2018-12-02 02:06:04,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:06:04,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:06:04,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:06:04,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:06:04,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:06:04,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:06:04,212 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 02:06:04,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:06:04,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:06:04,212 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 02:06:04,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:06:04,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:06:04,212 INFO L87 Difference]: Start difference. First operand 1291 states and 1575 transitions. cyclomatic complexity: 286 Second operand 3 states. [2018-12-02 02:06:04,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:06:04,488 INFO L93 Difference]: Finished difference Result 1290 states and 1468 transitions. [2018-12-02 02:06:04,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:06:04,488 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1290 states and 1468 transitions. [2018-12-02 02:06:04,491 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2018-12-02 02:06:04,493 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1290 states to 1290 states and 1468 transitions. [2018-12-02 02:06:04,494 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1290 [2018-12-02 02:06:04,494 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1290 [2018-12-02 02:06:04,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1290 states and 1468 transitions. [2018-12-02 02:06:04,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 02:06:04,495 INFO L705 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2018-12-02 02:06:04,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states and 1468 transitions. [2018-12-02 02:06:04,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1290. [2018-12-02 02:06:04,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1290 states. [2018-12-02 02:06:04,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1468 transitions. [2018-12-02 02:06:04,504 INFO L728 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2018-12-02 02:06:04,504 INFO L608 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2018-12-02 02:06:04,504 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 02:06:04,505 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1290 states and 1468 transitions. [2018-12-02 02:06:04,507 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2018-12-02 02:06:04,507 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 02:06:04,507 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 02:06:04,508 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 02:06:04,508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:06:04,508 INFO L794 eck$LassoCheckResult]: Stem: 8462#ULTIMATE.startENTRY ~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; 8325#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 8326#L606-2 [2018-12-02 02:06:04,508 INFO L796 eck$LassoCheckResult]: Loop: 8326#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 8712#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 8710#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); 8708#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 8706#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); 8704#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 8702#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); 8685#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 8683#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)); 8680#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); 8677#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); 8674#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); 8671#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 8668#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); 8665#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 8662#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 8659#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 8656#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); 8652#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); 8649#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 8646#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); 8643#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 8640#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 8637#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); 8634#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 8631#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); 8628#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); 8625#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 8622#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; 8374#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 8682#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 8679#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 8676#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); 8673#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 8670#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); 8667#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 8664#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); 8661#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 8658#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)); 8654#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); 8651#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); 8648#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); 8645#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 8642#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); 8639#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 8636#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 8633#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 8630#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); 8627#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); 8624#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 8621#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); 8618#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 8615#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 8612#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); 8609#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 8606#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); 8603#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); 8600#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 8597#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 8594#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 8591#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 8588#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); 8585#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 8582#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 8579#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 8576#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); 8573#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 8566#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 8564#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); 8561#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 8558#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); 8555#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); 8552#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 8549#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); 8546#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 8543#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 8540#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)); 8536#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); 8532#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; 8533#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 8326#L606-2 [2018-12-02 02:06:04,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:06:04,508 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-12-02 02:06:04,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:06:04,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:06:04,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:06:04,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:06:04,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:06:04,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:06:04,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:06:04,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:06:04,511 INFO L82 PathProgramCache]: Analyzing trace with hash -568851643, now seen corresponding path program 1 times [2018-12-02 02:06:04,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:06:04,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:06:04,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:06:04,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:06:04,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:06:04,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:06:04,540 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:06:04,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:06:04,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:06:04,540 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 02:06:04,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:06:04,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:06:04,541 INFO L87 Difference]: Start difference. First operand 1290 states and 1468 transitions. cyclomatic complexity: 180 Second operand 3 states. [2018-12-02 02:06:04,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:06:04,696 INFO L93 Difference]: Finished difference Result 1279 states and 1424 transitions. [2018-12-02 02:06:04,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:06:04,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1279 states and 1424 transitions. [2018-12-02 02:06:04,701 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1276 [2018-12-02 02:06:04,705 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1279 states to 1279 states and 1424 transitions. [2018-12-02 02:06:04,705 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1279 [2018-12-02 02:06:04,706 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1279 [2018-12-02 02:06:04,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1279 states and 1424 transitions. [2018-12-02 02:06:04,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 02:06:04,708 INFO L705 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2018-12-02 02:06:04,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states and 1424 transitions. [2018-12-02 02:06:04,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1279. [2018-12-02 02:06:04,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1279 states. [2018-12-02 02:06:04,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1424 transitions. [2018-12-02 02:06:04,723 INFO L728 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2018-12-02 02:06:04,723 INFO L608 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2018-12-02 02:06:04,723 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-02 02:06:04,723 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1279 states and 1424 transitions. [2018-12-02 02:06:04,726 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1276 [2018-12-02 02:06:04,727 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 02:06:04,727 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 02:06:04,727 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 02:06:04,727 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] [2018-12-02 02:06:04,728 INFO L794 eck$LassoCheckResult]: Stem: 11021#ULTIMATE.startENTRY ~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; 10900#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 10901#L606-2 [2018-12-02 02:06:04,728 INFO L796 eck$LassoCheckResult]: Loop: 10901#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 11770#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 11768#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); 11766#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 11765#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); 11763#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 11761#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); 11726#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 11727#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)); 11802#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); 11800#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); 11798#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); 11796#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 11794#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); 11792#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 11790#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 11788#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 11786#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); 11784#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); 11782#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 11780#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); 11778#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 11776#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 11774#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); 11772#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 11771#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); 11769#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); 11767#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 11728#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 11729#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 12096#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 12095#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); 12094#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 12093#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 12092#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 12091#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); 12089#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 12087#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 12085#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); 12083#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 12081#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); 12078#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); 11924#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 11922#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); 11921#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 11735#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 11736#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)); 11746#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); 11744#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); 11742#L259 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && (((9 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)); 11740#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); 11719#L276 assume !(7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 1 == ~a21~0 && 1 == ~a19~0 && 5 == calculate_output_~input && !(1 == ~a11~0)); 11049#L280 assume !(8 == ~a28~0 && 1 == ~a21~0 && (!(1 == ~a11~0) && (1 == calculate_output_~input && 8 == ~a17~0) && 1 == ~a19~0) && 1 == ~a25~0); 11028#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); 11015#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); 11016#L291 assume !(8 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a11~0) && 1 == ~a25~0 && 8 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a19~0); 10913#L293 assume !((1 == ~a19~0 && 8 == ~a17~0 && ((!(1 == ~a25~0) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a11~0)) && 11 == ~a28~0); 10914#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); 10969#L309 assume !((((((3 == calculate_output_~input && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)) && 11 == ~a28~0) && !(1 == ~a11~0)); 10970#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); 10975#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); 10976#L331 assume !((!(1 == ~a11~0) && (((4 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0) && 11 == ~a28~0) && 1 == ~a19~0); 12158#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)); 11037#L349 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && ((1 == ~a25~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 11 == ~a28~0) && 1 == ~a21~0); 10890#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); 10891#L361 assume !(1 == ~a19~0 && ((1 == ~a21~0 && (!(1 == ~a25~0) && 3 == calculate_output_~input) && 9 == ~a17~0) && 8 == ~a28~0) && 1 == ~a11~0); 10972#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)); 10965#L375 assume !(1 == ~a19~0 && (((8 == ~a17~0 && 5 == calculate_output_~input && !(1 == ~a11~0)) && 1 == ~a21~0) && 1 == ~a25~0) && 8 == ~a28~0); 10956#L378 assume !(((!(1 == ~a11~0) && ((1 == ~a21~0 && 4 == calculate_output_~input) && 10 == ~a28~0) && 8 == ~a17~0) && !(1 == ~a19~0)) && 1 == ~a25~0); 10957#L380 assume !(8 == ~a28~0 && (1 == ~a19~0 && 1 == ~a11~0 && !(1 == ~a25~0) && 9 == ~a17~0 && 6 == calculate_output_~input) && 1 == ~a21~0); 10954#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)); 10955#L394 assume !(((((!(1 == ~a25~0) && 1 == ~a19~0 && 3 == calculate_output_~input) && 9 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 10886#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)); 10887#L402 assume !(((!(1 == ~a11~0) && ((1 == ~a19~0 && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)); 11000#L404 assume !((1 == ~a11~0 && 1 == ~a19~0 && 1 == ~a21~0 && (9 == ~a17~0 && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 8 == ~a28~0); 11031#L407 assume !(!(1 == ~a11~0) && 1 == ~a21~0 && (1 == ~a19~0 && 8 == ~a17~0 && 1 == ~a25~0 && 5 == calculate_output_~input) && 11 == ~a28~0); 10884#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); 10885#L414 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10924#L414-2 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10918#L417-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10888#L420-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10889#L423-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 11036#L426-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11032#L429-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11025#L432-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 11026#L435-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10995#L438-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10996#L441-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10953#L444-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10925#L447-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10917#L450-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 10882#L453-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10883#L456-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11046#L459-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11029#L462-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11024#L465-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10999#L468-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10994#L471-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10958#L474-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 10951#L477-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10952#L480-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12125#L483-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12124#L486-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12123#L489-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12122#L492-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12121#L495-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12120#L498-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12119#L501-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12118#L504-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12117#L507-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12116#L510-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12115#L513-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12114#L516-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12107#L519-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11936#L522-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11935#L525-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11934#L528-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11932#L531-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11931#L534-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11810#L537-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 11809#L540-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11807#L543-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 11805#L546-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11804#L549-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11803#L552-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11801#L555-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11799#L558-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11797#L561-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11795#L564-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11793#L567-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11791#L570-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11789#L573-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11787#L576-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11785#L579-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 11783#L582-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 11781#L585-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11779#L588-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11777#L591-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11775#L594-1 calculate_output_#res := -2; 11773#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 10901#L606-2 [2018-12-02 02:06:04,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:06:04,729 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-12-02 02:06:04,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:06:04,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:06:04,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:06:04,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:06:04,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:06:04,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:06:04,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:06:04,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:06:04,733 INFO L82 PathProgramCache]: Analyzing trace with hash 2053340219, now seen corresponding path program 1 times [2018-12-02 02:06:04,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:06:04,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:06:04,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:06:04,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:06:04,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:06:04,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:06:04,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:06:04,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:06:04,774 INFO L82 PathProgramCache]: Analyzing trace with hash 41143549, now seen corresponding path program 1 times [2018-12-02 02:06:04,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:06:04,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:06:04,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:06:04,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:06:04,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:06:04,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:06:05,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:06:05,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:06:05,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 02:06:05,704 WARN L180 SmtUtils]: Spent 640.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2018-12-02 02:06:05,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 02:06:05,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-12-02 02:06:05,766 INFO L87 Difference]: Start difference. First operand 1279 states and 1424 transitions. cyclomatic complexity: 148 Second operand 10 states. [2018-12-02 02:06:06,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:06:06,193 INFO L93 Difference]: Finished difference Result 1225 states and 1369 transitions. [2018-12-02 02:06:06,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 02:06:06,193 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1225 states and 1369 transitions. [2018-12-02 02:06:06,196 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1136 [2018-12-02 02:06:06,200 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1225 states to 1191 states and 1335 transitions. [2018-12-02 02:06:06,200 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1191 [2018-12-02 02:06:06,201 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1191 [2018-12-02 02:06:06,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1191 states and 1335 transitions. [2018-12-02 02:06:06,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 02:06:06,203 INFO L705 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2018-12-02 02:06:06,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states and 1335 transitions. [2018-12-02 02:06:06,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1191. [2018-12-02 02:06:06,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1191 states. [2018-12-02 02:06:06,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1335 transitions. [2018-12-02 02:06:06,216 INFO L728 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2018-12-02 02:06:06,216 INFO L608 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2018-12-02 02:06:06,216 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-02 02:06:06,216 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1191 states and 1335 transitions. [2018-12-02 02:06:06,220 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1136 [2018-12-02 02:06:06,220 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 02:06:06,220 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 02:06:06,220 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-02 02:06:06,220 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:06:06,221 INFO L794 eck$LassoCheckResult]: Stem: 13549#ULTIMATE.startENTRY ~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; 13429#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 13430#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 14305#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 14303#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); 14301#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; 13503#L597 [2018-12-02 02:06:06,221 INFO L796 eck$LassoCheckResult]: Loop: 13503#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 13504#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 13505#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 13539#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); 13543#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 13558#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); 13498#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 13499#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; 13503#L597 [2018-12-02 02:06:06,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:06:06,221 INFO L82 PathProgramCache]: Analyzing trace with hash 889694475, now seen corresponding path program 1 times [2018-12-02 02:06:06,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:06:06,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:06:06,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:06:06,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:06:06,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:06:06,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:06:06,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:06:06,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:06:06,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1141479969, now seen corresponding path program 1 times [2018-12-02 02:06:06,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:06:06,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:06:06,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:06:06,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:06:06,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:06:06,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:06:06,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:06:06,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:06:06,233 INFO L82 PathProgramCache]: Analyzing trace with hash 2047121707, now seen corresponding path program 1 times [2018-12-02 02:06:06,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:06:06,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:06:06,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:06:06,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:06:06,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:06:06,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:06:06,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:06:06,375 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 02:06:06,375 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 02:06:06,375 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 02:06:06,375 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 02:06:06,375 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 02:06:06,375 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 02:06:06,375 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 02:06:06,375 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 02:06:06,375 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label41_true-unreach-call_false-termination.c_Iteration8_Lasso [2018-12-02 02:06:06,376 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 02:06:06,376 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 02:06:06,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:06:06,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:06:06,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:06:06,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:06:06,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:06:06,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:06:06,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:06:06,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:06:06,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:06:06,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:06:06,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:06:06,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:06:06,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:06:06,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:06:06,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:06:06,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:06:06,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:06:06,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:06:06,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:06:06,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:06:06,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 02:06:06,544 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 02:06:06,544 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f3c194e-336b-4c54-b7d3-9f08135e7831/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-12-02 02:06:06,546 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 02:06:06,547 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 02:06:06,548 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 02:06:06,548 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_3f3c194e-336b-4c54-b7d3-9f08135e7831/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-12-02 02:06:06,564 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 02:06:06,564 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 02:06:06,566 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 02:06:06,566 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_3f3c194e-336b-4c54-b7d3-9f08135e7831/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-12-02 02:06:06,581 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 02:06:06,581 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 02:06:06,582 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 02:06:06,582 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_3f3c194e-336b-4c54-b7d3-9f08135e7831/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-12-02 02:06:06,597 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 02:06:06,597 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 02:06:06,600 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 02:06:06,600 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_3f3c194e-336b-4c54-b7d3-9f08135e7831/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-12-02 02:06:06,616 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 02:06:06,616 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 02:06:06,618 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 02:06:06,618 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_3f3c194e-336b-4c54-b7d3-9f08135e7831/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-12-02 02:06:06,633 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 02:06:06,633 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 02:06:06,635 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 02:06:06,635 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_3f3c194e-336b-4c54-b7d3-9f08135e7831/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-12-02 02:06:06,651 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 02:06:06,651 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 02:06:06,653 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 02:06:06,653 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_3f3c194e-336b-4c54-b7d3-9f08135e7831/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-12-02 02:06:06,667 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 02:06:06,667 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 02:06:06,669 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 02:06:06,669 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_3f3c194e-336b-4c54-b7d3-9f08135e7831/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-12-02 02:06:06,683 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 02:06:06,684 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 02:06:06,686 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 02:06:06,686 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_3f3c194e-336b-4c54-b7d3-9f08135e7831/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-12-02 02:06:06,701 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 02:06:06,701 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 02:06:06,703 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 02:06:06,703 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_3f3c194e-336b-4c54-b7d3-9f08135e7831/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-12-02 02:06:06,718 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 02:06:06,718 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 02:06:06,720 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 02:06:06,720 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_3f3c194e-336b-4c54-b7d3-9f08135e7831/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-12-02 02:06:06,735 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 02:06:06,735 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 02:06:06,737 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 02:06:06,737 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_3f3c194e-336b-4c54-b7d3-9f08135e7831/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-12-02 02:06:06,759 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 02:06:06,759 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 02:06:06,761 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 02:06:06,761 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_3f3c194e-336b-4c54-b7d3-9f08135e7831/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-12-02 02:06:06,776 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 02:06:06,776 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 02:06:06,778 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 02:06:06,778 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_3f3c194e-336b-4c54-b7d3-9f08135e7831/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-12-02 02:06:06,792 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 02:06:06,792 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 02:06:06,794 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 02:06:06,794 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_3f3c194e-336b-4c54-b7d3-9f08135e7831/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-12-02 02:06:06,809 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 02:06:06,809 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f3c194e-336b-4c54-b7d3-9f08135e7831/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-12-02 02:06:06,827 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 02:06:06,827 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 02:06:06,976 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 02:06:06,976 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_3f3c194e-336b-4c54-b7d3-9f08135e7831/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-12-02 02:06:06,991 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 02:06:06,991 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 02:06:06,993 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 02:06:06,993 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_3f3c194e-336b-4c54-b7d3-9f08135e7831/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-12-02 02:06:07,008 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 02:06:07,008 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 02:06:07,010 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 02:06:07,010 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_3f3c194e-336b-4c54-b7d3-9f08135e7831/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-12-02 02:06:07,024 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 02:06:07,024 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f3c194e-336b-4c54-b7d3-9f08135e7831/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-12-02 02:06:07,041 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 02:06:07,041 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 02:06:07,175 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 02:06:07,175 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_3f3c194e-336b-4c54-b7d3-9f08135e7831/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-12-02 02:06:07,189 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 02:06:07,189 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 02:06:07,191 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 02:06:07,191 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_3f3c194e-336b-4c54-b7d3-9f08135e7831/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-12-02 02:06:07,206 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 02:06:07,207 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 02:06:07,208 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 02:06:07,208 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a28~0=0} Honda state: {~a28~0=10} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2018-12-02 02:06:07,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 02:06:07 BoogieIcfgContainer [2018-12-02 02:06:07,238 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 02:06:07,238 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 02:06:07,238 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 02:06:07,238 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 02:06:07,239 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:06:00" (3/4) ... [2018-12-02 02:06:07,241 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-12-02 02:06:07,267 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3f3c194e-336b-4c54-b7d3-9f08135e7831/bin-2019/uautomizer/witness.graphml [2018-12-02 02:06:07,267 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 02:06:07,268 INFO L168 Benchmark]: Toolchain (without parser) took 7964.13 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 477.1 MB). Free memory was 951.7 MB in the beginning and 1.3 GB in the end (delta: -375.8 MB). Peak memory consumption was 101.3 MB. Max. memory is 11.5 GB. [2018-12-02 02:06:07,268 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 02:06:07,268 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -159.4 MB). Peak memory consumption was 37.7 MB. Max. memory is 11.5 GB. [2018-12-02 02:06:07,268 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-12-02 02:06:07,269 INFO L168 Benchmark]: Boogie Preprocessor took 27.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 02:06:07,269 INFO L168 Benchmark]: RCFGBuilder took 637.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 989.5 MB in the end (delta: 114.5 MB). Peak memory consumption was 114.5 MB. Max. memory is 11.5 GB. [2018-12-02 02:06:07,269 INFO L168 Benchmark]: BuchiAutomizer took 6922.57 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 348.7 MB). Free memory was 989.5 MB in the beginning and 1.3 GB in the end (delta: -350.6 MB). Peak memory consumption was 543.3 MB. Max. memory is 11.5 GB. [2018-12-02 02:06:07,269 INFO L168 Benchmark]: Witness Printer took 29.06 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 11.5 GB. [2018-12-02 02:06:07,270 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.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 305.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -159.4 MB). Peak memory consumption was 37.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 637.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 989.5 MB in the end (delta: 114.5 MB). Peak memory consumption was 114.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6922.57 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 348.7 MB). Free memory was 989.5 MB in the beginning and 1.3 GB in the end (delta: -350.6 MB). Peak memory consumption was 543.3 MB. Max. memory is 11.5 GB. * Witness Printer took 29.06 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. 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 1191 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.8s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 4.2s. Construction of modules took 1.7s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 1291 states and ocurred in iteration 4. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 897 SDtfs, 1440 SDslu, 122 SDs, 0 SdLazy, 2979 SolverSat, 509 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s 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: 49ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 0 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 31 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s - 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@7a6ef5e0=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7b96232e=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@7a6ef5e0=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7b96232e=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@7a6ef5e0=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@7b96232e=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)) [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] 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)) [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...