./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label57_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_d6650dba-e3c7-438c-83d0-f3931691c183/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d6650dba-e3c7-438c-83d0-f3931691c183/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d6650dba-e3c7-438c-83d0-f3931691c183/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d6650dba-e3c7-438c-83d0-f3931691c183/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label57_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d6650dba-e3c7-438c-83d0-f3931691c183/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d6650dba-e3c7-438c-83d0-f3931691c183/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 7289a24916410dada55d7befe9c59871f03a3aa1 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-08 19:16:07,587 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 19:16:07,588 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 19:16:07,595 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 19:16:07,595 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 19:16:07,596 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 19:16:07,597 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 19:16:07,598 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 19:16:07,599 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 19:16:07,600 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 19:16:07,600 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 19:16:07,600 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 19:16:07,601 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 19:16:07,602 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 19:16:07,602 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 19:16:07,603 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 19:16:07,603 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 19:16:07,605 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 19:16:07,606 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 19:16:07,607 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 19:16:07,608 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 19:16:07,609 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 19:16:07,610 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 19:16:07,611 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 19:16:07,611 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 19:16:07,611 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 19:16:07,612 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 19:16:07,613 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 19:16:07,613 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 19:16:07,614 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 19:16:07,614 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 19:16:07,615 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 19:16:07,615 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 19:16:07,615 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 19:16:07,615 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 19:16:07,616 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 19:16:07,616 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d6650dba-e3c7-438c-83d0-f3931691c183/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-08 19:16:07,627 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 19:16:07,627 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 19:16:07,628 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 19:16:07,628 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 19:16:07,628 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 19:16:07,629 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-08 19:16:07,629 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-08 19:16:07,629 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-08 19:16:07,629 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-08 19:16:07,629 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-08 19:16:07,629 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-08 19:16:07,629 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 19:16:07,629 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 19:16:07,629 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 19:16:07,629 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 19:16:07,630 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 19:16:07,630 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 19:16:07,630 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-08 19:16:07,630 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-08 19:16:07,630 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-08 19:16:07,630 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 19:16:07,630 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 19:16:07,630 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-08 19:16:07,631 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 19:16:07,631 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-08 19:16:07,631 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 19:16:07,631 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 19:16:07,631 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-08 19:16:07,631 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 19:16:07,631 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 19:16:07,631 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-08 19:16:07,632 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-08 19:16:07,632 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_d6650dba-e3c7-438c-83d0-f3931691c183/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 -> 7289a24916410dada55d7befe9c59871f03a3aa1 [2018-12-08 19:16:07,654 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 19:16:07,663 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 19:16:07,665 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 19:16:07,666 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 19:16:07,667 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 19:16:07,667 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d6650dba-e3c7-438c-83d0-f3931691c183/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label57_true-unreach-call_false-termination.c [2018-12-08 19:16:07,712 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d6650dba-e3c7-438c-83d0-f3931691c183/bin-2019/uautomizer/data/bfd1f09b4/a7867e607ad74aacbaa220a22f87e25d/FLAGcb4e3b37d [2018-12-08 19:16:08,156 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 19:16:08,156 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d6650dba-e3c7-438c-83d0-f3931691c183/sv-benchmarks/c/eca-rers2012/Problem02_label57_true-unreach-call_false-termination.c [2018-12-08 19:16:08,163 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d6650dba-e3c7-438c-83d0-f3931691c183/bin-2019/uautomizer/data/bfd1f09b4/a7867e607ad74aacbaa220a22f87e25d/FLAGcb4e3b37d [2018-12-08 19:16:08,545 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d6650dba-e3c7-438c-83d0-f3931691c183/bin-2019/uautomizer/data/bfd1f09b4/a7867e607ad74aacbaa220a22f87e25d [2018-12-08 19:16:08,547 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 19:16:08,549 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 19:16:08,549 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 19:16:08,549 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 19:16:08,552 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 19:16:08,552 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 07:16:08" (1/1) ... [2018-12-08 19:16:08,554 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ec9f2fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:16:08, skipping insertion in model container [2018-12-08 19:16:08,554 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 07:16:08" (1/1) ... [2018-12-08 19:16:08,559 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 19:16:08,590 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 19:16:08,765 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 19:16:08,768 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 19:16:08,850 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 19:16:08,860 INFO L195 MainTranslator]: Completed translation [2018-12-08 19:16:08,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:16:08 WrapperNode [2018-12-08 19:16:08,860 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 19:16:08,861 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 19:16:08,861 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 19:16:08,861 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 19:16:08,866 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:16:08" (1/1) ... [2018-12-08 19:16:08,875 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:16:08" (1/1) ... [2018-12-08 19:16:08,900 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 19:16:08,901 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 19:16:08,901 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 19:16:08,901 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 19:16:08,906 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:16:08" (1/1) ... [2018-12-08 19:16:08,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:16:08" (1/1) ... [2018-12-08 19:16:08,909 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:16:08" (1/1) ... [2018-12-08 19:16:08,909 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:16:08" (1/1) ... [2018-12-08 19:16:08,917 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:16:08" (1/1) ... [2018-12-08 19:16:08,923 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:16:08" (1/1) ... [2018-12-08 19:16:08,926 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:16:08" (1/1) ... [2018-12-08 19:16:08,929 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 19:16:08,929 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 19:16:08,929 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 19:16:08,930 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 19:16:08,930 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:16:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6650dba-e3c7-438c-83d0-f3931691c183/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-08 19:16:08,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 19:16:08,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 19:16:09,513 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 19:16:09,514 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-08 19:16:09,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 07:16:09 BoogieIcfgContainer [2018-12-08 19:16:09,514 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 19:16:09,515 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-08 19:16:09,515 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-08 19:16:09,518 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-08 19:16:09,519 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 19:16:09,519 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.12 07:16:08" (1/3) ... [2018-12-08 19:16:09,520 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@33de5672 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 07:16:09, skipping insertion in model container [2018-12-08 19:16:09,520 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 19:16:09,521 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:16:08" (2/3) ... [2018-12-08 19:16:09,521 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@33de5672 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 07:16:09, skipping insertion in model container [2018-12-08 19:16:09,521 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 19:16:09,521 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 07:16:09" (3/3) ... [2018-12-08 19:16:09,523 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label57_true-unreach-call_false-termination.c [2018-12-08 19:16:09,571 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 19:16:09,571 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-08 19:16:09,571 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-08 19:16:09,572 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-08 19:16:09,572 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 19:16:09,572 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 19:16:09,572 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-08 19:16:09,572 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 19:16:09,572 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-08 19:16:09,590 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2018-12-08 19:16:09,616 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2018-12-08 19:16:09,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 19:16:09,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 19:16:09,624 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 19:16:09,624 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 19:16:09,624 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-08 19:16:09,624 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2018-12-08 19:16:09,630 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2018-12-08 19:16:09,630 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 19:16:09,630 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 19:16:09,631 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 19:16:09,631 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 19:16:09,638 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-08 19:16:09,638 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-08 19:16:09,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:16:09,644 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-08 19:16:09,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 19:16:09,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 19:16:09,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:09,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:16:09,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:09,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 19:16:09,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 19:16:09,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:16:09,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1268139, now seen corresponding path program 1 times [2018-12-08 19:16:09,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 19:16:09,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 19:16:09,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:09,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:16:09,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:09,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 19:16:09,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 19:16:09,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:16:09,744 INFO L82 PathProgramCache]: Analyzing trace with hash 889695341, now seen corresponding path program 1 times [2018-12-08 19:16:09,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 19:16:09,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 19:16:09,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:09,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:16:09,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:09,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:16:09,806 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-08 19:16:09,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:16:09,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 19:16:09,916 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 19:16:09,917 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 19:16:09,917 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 19:16:09,917 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 19:16:09,918 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-08 19:16:09,918 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 19:16:09,918 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 19:16:09,918 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 19:16:09,918 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label57_true-unreach-call_false-termination.c_Iteration1_Loop [2018-12-08 19:16:09,918 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 19:16:09,919 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 19:16:09,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 19:16:09,942 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-08 19:16:09,962 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-08 19:16:09,965 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-08 19:16:09,968 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-08 19:16:09,972 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-08 19:16:09,973 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-08 19:16:09,978 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-08 19:16:10,130 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 19:16:10,130 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6650dba-e3c7-438c-83d0-f3931691c183/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-08 19:16:10,134 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 19:16:10,134 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 19:16:10,139 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 19:16:10,139 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_d6650dba-e3c7-438c-83d0-f3931691c183/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-08 19:16:10,162 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 19:16:10,163 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 19:16:10,166 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 19:16:10,167 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_d6650dba-e3c7-438c-83d0-f3931691c183/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-08 19:16:10,182 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 19:16:10,182 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 19:16:10,185 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 19:16:10,185 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_d6650dba-e3c7-438c-83d0-f3931691c183/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-08 19:16:10,205 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 19:16:10,206 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 19:16:10,208 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 19:16:10,208 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_d6650dba-e3c7-438c-83d0-f3931691c183/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-08 19:16:10,223 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 19:16:10,223 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 19:16:10,226 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 19:16:10,226 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_d6650dba-e3c7-438c-83d0-f3931691c183/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-08 19:16:10,241 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 19:16:10,241 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 19:16:10,243 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 19:16:10,243 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_d6650dba-e3c7-438c-83d0-f3931691c183/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-08 19:16:10,258 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 19:16:10,258 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 19:16:10,262 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 19:16:10,262 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_d6650dba-e3c7-438c-83d0-f3931691c183/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-08 19:16:10,277 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 19:16:10,277 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6650dba-e3c7-438c-83d0-f3931691c183/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-08 19:16:10,294 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-08 19:16:10,295 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 19:16:10,316 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-08 19:16:10,317 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 19:16:10,317 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 19:16:10,317 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 19:16:10,317 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 19:16:10,317 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 19:16:10,317 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 19:16:10,317 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 19:16:10,317 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 19:16:10,318 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label57_true-unreach-call_false-termination.c_Iteration1_Loop [2018-12-08 19:16:10,318 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 19:16:10,318 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 19:16:10,319 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-08 19:16:10,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 19:16:10,326 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-08 19:16:10,363 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-08 19:16:10,367 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-08 19:16:10,368 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-08 19:16:10,371 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-08 19:16:10,372 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-08 19:16:10,503 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 19:16:10,507 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 19:16:10,508 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:10,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:10,509 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:10,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 19:16:10,512 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 19:16:10,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:10,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:10,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:10,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 19:16:10,522 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 19:16:10,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,525 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:10,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:10,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,526 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-08 19:16:10,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 19:16:10,527 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 19:16:10,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,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-08 19:16:10,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:10,546 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:10,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 19:16:10,548 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 19:16:10,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,551 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:10,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:10,552 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:10,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 19:16:10,553 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 19:16:10,553 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,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-08 19:16:10,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:10,556 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:10,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 19:16:10,556 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 19:16:10,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,559 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:10,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:10,560 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:10,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 19:16:10,560 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 19:16:10,561 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,562 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:10,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:10,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,563 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 19:16:10,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 19:16:10,563 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 19:16:10,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,568 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-12-08 19:16:10,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-08 19:16:10,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:10,569 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:10,569 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 19:16:10,570 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 19:16:10,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:10,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:10,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:10,578 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 19:16:10,579 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 19:16:10,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:10,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:10,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,582 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-08 19:16:10,582 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 19:16:10,584 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-08 19:16:10,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,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-08 19:16:10,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:10,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:10,600 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 19:16:10,601 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 19:16:10,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:10,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:10,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:10,606 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 19:16:10,606 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 19:16:10,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,608 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,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-08 19:16:10,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:10,609 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:10,610 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 19:16:10,610 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 19:16:10,610 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,612 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:10,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:10,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:10,613 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 19:16:10,613 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 19:16:10,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,614 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:10,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:10,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,615 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 19:16:10,615 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 19:16:10,616 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 19:16:10,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,620 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-12-08 19:16:10,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:10,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:10,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:10,621 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 19:16:10,622 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 19:16:10,623 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,628 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,628 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:10,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:10,629 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:10,629 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 19:16:10,630 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 19:16:10,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,632 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:10,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:10,632 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,633 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-08 19:16:10,633 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 19:16:10,634 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 19:16:10,634 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,645 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:10,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:10,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:10,646 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 19:16:10,647 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 19:16:10,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:10,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:10,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:10,651 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 19:16:10,651 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 19:16:10,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,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-08 19:16:10,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:10,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:10,654 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 19:16:10,655 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 19:16:10,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:10,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:10,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:10,657 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 19:16:10,657 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 19:16:10,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,658 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:10,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:10,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,659 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 19:16:10,659 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 19:16:10,660 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 19:16:10,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,663 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-12-08 19:16:10,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:10,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:10,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:10,665 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 19:16:10,666 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 19:16:10,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,671 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:10,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:10,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:10,672 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 19:16:10,673 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 19:16:10,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,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-08 19:16:10,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:10,675 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,675 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-08 19:16:10,675 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 19:16:10,676 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-08 19:16:10,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:10,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:10,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:10,689 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 19:16:10,689 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 19:16:10,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:10,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:10,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:10,694 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 19:16:10,694 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 19:16:10,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:10,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:10,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:10,697 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 19:16:10,697 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 19:16:10,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,699 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:10,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:10,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:10,700 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 19:16:10,700 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 19:16:10,700 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,701 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:10,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:10,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,701 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 19:16:10,701 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 19:16:10,702 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-08 19:16:10,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,705 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-12-08 19:16:10,705 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:10,706 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:10,706 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 19:16:10,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:10,706 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 19:16:10,707 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 19:16:10,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,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-08 19:16:10,719 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:10,719 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 19:16:10,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:10,719 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 19:16:10,719 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 19:16:10,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,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-08 19:16:10,722 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:10,722 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 19:16:10,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,723 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-08 19:16:10,723 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 19:16:10,724 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-08 19:16:10,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,746 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:10,746 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:10,746 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 19:16:10,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:10,747 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 19:16:10,747 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 19:16:10,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:10,751 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:10,751 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 19:16:10,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:10,752 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 19:16:10,752 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 19:16:10,752 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,754 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:10,755 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:10,755 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 19:16:10,755 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:10,755 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 19:16:10,756 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 19:16:10,756 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:10,759 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:10,759 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 19:16:10,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:10,759 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 19:16:10,760 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 19:16:10,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,760 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:10,761 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:10,761 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 19:16:10,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,761 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 19:16:10,761 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 19:16:10,762 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 19:16:10,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,765 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-12-08 19:16:10,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:10,766 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:10,766 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-08 19:16:10,766 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:10,766 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 19:16:10,767 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 19:16:10,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,777 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:10,777 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:10,778 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-08 19:16:10,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:10,778 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 19:16:10,778 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 19:16:10,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:10,781 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:10,781 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-08 19:16:10,781 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,781 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-08 19:16:10,782 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 19:16:10,783 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 19:16:10,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,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-08 19:16:10,803 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:10,803 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-08 19:16:10,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:10,803 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 19:16:10,803 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 19:16:10,804 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:10,807 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:10,807 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-08 19:16:10,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:10,807 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 19:16:10,808 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 19:16:10,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,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-08 19:16:10,810 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:10,810 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-08 19:16:10,810 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:10,811 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 19:16:10,811 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 19:16:10,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:10,813 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:10,814 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-08 19:16:10,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:10,814 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 19:16:10,814 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 19:16:10,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,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-08 19:16:10,816 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:10,816 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-08 19:16:10,816 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,816 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 19:16:10,816 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 19:16:10,817 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 19:16:10,818 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,825 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-12-08 19:16:10,825 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:10,825 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:10,825 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 19:16:10,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:10,826 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 19:16:10,827 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 19:16:10,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:10,834 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:10,834 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 19:16:10,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:10,834 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 19:16:10,835 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 19:16:10,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,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-08 19:16:10,838 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:10,838 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 19:16:10,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,839 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-08 19:16:10,839 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 19:16:10,842 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-08 19:16:10,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,867 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:10,867 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:10,868 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 19:16:10,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:10,868 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 19:16:10,870 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 19:16:10,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,875 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:10,875 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:10,875 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 19:16:10,875 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:10,876 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 19:16:10,876 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 19:16:10,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,880 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:10,880 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:10,880 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 19:16:10,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:10,880 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 19:16:10,881 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 19:16:10,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:10,884 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:10,884 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 19:16:10,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:10,884 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 19:16:10,885 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 19:16:10,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,885 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:10,886 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:10,886 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 19:16:10,886 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,886 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 19:16:10,886 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 19:16:10,887 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-08 19:16:10,887 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,893 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-12-08 19:16:10,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-08 19:16:10,894 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:10,894 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 19:16:10,894 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:10,894 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 19:16:10,895 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 19:16:10,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,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-08 19:16:10,902 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:10,902 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 19:16:10,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:10,903 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 19:16:10,903 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 19:16:10,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:10,906 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:10,906 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 19:16:10,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,907 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-08 19:16:10,907 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 19:16:10,907 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 19:16:10,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,917 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:10,918 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:10,918 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 19:16:10,918 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:10,918 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 19:16:10,919 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 19:16:10,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,921 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:10,922 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:10,922 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 19:16:10,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:10,922 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 19:16:10,922 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 19:16:10,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,924 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:10,924 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:10,924 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 19:16:10,924 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:10,924 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 19:16:10,925 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 19:16:10,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,926 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:10,926 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:10,926 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 19:16:10,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:10,926 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 19:16:10,927 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 19:16:10,927 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,928 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:10,928 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:10,928 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 19:16:10,928 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,928 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 19:16:10,928 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 19:16:10,928 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 19:16:10,928 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,932 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,933 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-12-08 19:16:10,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:10,933 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:10,933 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 19:16:10,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:10,934 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-08 19:16:10,935 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 19:16:10,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:10,952 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:10,952 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 19:16:10,952 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:10,953 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-08 19:16:10,953 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 19:16:10,953 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:10,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:10,955 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:10,955 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:10,956 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 19:16:10,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:10,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:10,956 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-08 19:16:10,956 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-08 19:16:10,957 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-12-08 19:16:10,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:11,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:11,005 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:11,005 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:11,005 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 19:16:11,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:11,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:11,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:11,006 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-08 19:16:11,007 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 19:16:11,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:11,013 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:11,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:11,014 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:11,014 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 19:16:11,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:11,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:11,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:11,015 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-08 19:16:11,015 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 19:16:11,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:11,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:11,017 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:11,018 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:11,018 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 19:16:11,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:11,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:11,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:11,018 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-08 19:16:11,018 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 19:16:11,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:11,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:11,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:11,021 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:11,021 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 19:16:11,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:11,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:11,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:11,021 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-08 19:16:11,022 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 19:16:11,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:11,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:11,023 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:11,023 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:11,024 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 19:16:11,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:11,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:11,024 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 19:16:11,024 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-08 19:16:11,025 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 19:16:11,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:11,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:11,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 19:16:11,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 19:16:11,041 INFO L87 Difference]: Start difference. First operand 226 states. Second operand 3 states. [2018-12-08 19:16:11,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:16:11,531 INFO L93 Difference]: Finished difference Result 379 states and 480 transitions. [2018-12-08 19:16:11,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 19:16:11,532 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 379 states and 480 transitions. [2018-12-08 19:16:11,535 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 304 [2018-12-08 19:16:11,539 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 379 states to 306 states and 407 transitions. [2018-12-08 19:16:11,540 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 306 [2018-12-08 19:16:11,541 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 306 [2018-12-08 19:16:11,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 306 states and 407 transitions. [2018-12-08 19:16:11,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 19:16:11,542 INFO L705 BuchiCegarLoop]: Abstraction has 306 states and 407 transitions. [2018-12-08 19:16:11,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states and 407 transitions. [2018-12-08 19:16:11,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2018-12-08 19:16:11,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-12-08 19:16:11,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 405 transitions. [2018-12-08 19:16:11,567 INFO L728 BuchiCegarLoop]: Abstraction has 305 states and 405 transitions. [2018-12-08 19:16:11,567 INFO L608 BuchiCegarLoop]: Abstraction has 305 states and 405 transitions. [2018-12-08 19:16:11,567 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-08 19:16:11,567 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 305 states and 405 transitions. [2018-12-08 19:16:11,568 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 303 [2018-12-08 19:16:11,568 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 19:16:11,568 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 19:16:11,568 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 19:16:11,568 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:16:11,568 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-08 19:16:11,569 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-08 19:16:11,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:16:11,569 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-12-08 19:16:11,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 19:16:11,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 19:16:11,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:11,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:16:11,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:11,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 19:16:11,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 19:16:11,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:16:11,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1948456188, now seen corresponding path program 1 times [2018-12-08 19:16:11,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 19:16:11,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 19:16:11,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:11,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 19:16:11,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:11,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 19:16:11,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 19:16:11,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:16:11,581 INFO L82 PathProgramCache]: Analyzing trace with hash -141898178, now seen corresponding path program 1 times [2018-12-08 19:16:11,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 19:16:11,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 19:16:11,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:11,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:16:11,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:11,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:16:11,590 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-08 19:16:11,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:16:11,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 19:16:11,671 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 19:16:11,671 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 19:16:11,671 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 19:16:11,671 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 19:16:11,671 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-08 19:16:11,671 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 19:16:11,671 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 19:16:11,671 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 19:16:11,671 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label57_true-unreach-call_false-termination.c_Iteration2_Loop [2018-12-08 19:16:11,671 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 19:16:11,671 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 19:16:11,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 19:16:11,674 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-08 19:16:11,680 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-08 19:16:11,681 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-08 19:16:11,682 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-08 19:16:11,683 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-08 19:16:11,686 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-08 19:16:11,690 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-08 19:16:11,762 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 19:16:11,762 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6650dba-e3c7-438c-83d0-f3931691c183/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-08 19:16:11,764 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 19:16:11,764 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 19:16:11,766 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 19:16:11,766 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_d6650dba-e3c7-438c-83d0-f3931691c183/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-08 19:16:11,781 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 19:16:11,781 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 19:16:11,783 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 19:16:11,783 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_d6650dba-e3c7-438c-83d0-f3931691c183/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-08 19:16:11,798 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 19:16:11,798 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 19:16:11,800 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 19:16:11,801 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_d6650dba-e3c7-438c-83d0-f3931691c183/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-08 19:16:11,816 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 19:16:11,816 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 19:16:11,817 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 19:16:11,817 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_d6650dba-e3c7-438c-83d0-f3931691c183/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-08 19:16:11,832 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 19:16:11,832 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 19:16:11,834 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 19:16:11,834 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_d6650dba-e3c7-438c-83d0-f3931691c183/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-08 19:16:11,849 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 19:16:11,849 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6650dba-e3c7-438c-83d0-f3931691c183/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-08 19:16:11,866 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-08 19:16:11,866 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 19:16:11,886 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-08 19:16:11,888 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 19:16:11,888 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 19:16:11,888 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 19:16:11,888 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 19:16:11,888 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 19:16:11,888 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 19:16:11,888 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 19:16:11,888 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 19:16:11,888 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label57_true-unreach-call_false-termination.c_Iteration2_Loop [2018-12-08 19:16:11,888 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 19:16:11,888 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 19:16:11,889 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-08 19:16:11,892 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-08 19:16:11,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 19:16:11,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 19:16:11,896 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-08 19:16:11,898 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-08 19:16:11,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 19:16:11,910 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-08 19:16:11,985 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 19:16:11,985 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 19:16:11,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-08 19:16:11,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:11,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:11,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:11,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:11,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 19:16:11,986 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 19:16:11,986 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:11,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:11,987 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:11,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:11,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:11,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:11,988 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 19:16:11,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 19:16:11,988 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 19:16:11,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:11,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:11,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:11,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:11,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:11,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:11,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:11,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 19:16:11,990 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 19:16:11,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:11,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:11,990 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:11,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:11,990 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:11,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:11,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:11,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 19:16:11,991 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 19:16:11,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:11,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:11,991 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:11,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:11,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:11,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:11,992 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 19:16:11,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 19:16:11,992 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 19:16:11,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:11,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:11,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:11,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:11,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:11,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:11,995 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 19:16:11,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 19:16:11,995 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 19:16:11,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:11,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:11,997 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:11,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:11,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:11,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:11,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:11,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 19:16:11,998 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 19:16:11,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:12,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:12,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:12,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 19:16:12,001 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 19:16:12,001 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,002 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,002 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-12-08 19:16:12,002 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:12,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:12,003 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:12,003 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 19:16:12,003 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 19:16:12,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,004 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:12,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:12,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,005 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 19:16:12,005 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 19:16:12,005 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 19:16:12,006 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:12,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:12,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:12,007 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 19:16:12,007 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 19:16:12,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:12,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:12,008 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:12,008 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 19:16:12,009 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 19:16:12,009 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,009 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:12,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:12,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,010 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 19:16:12,010 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 19:16:12,011 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 19:16:12,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,012 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:12,013 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:12,013 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,013 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 19:16:12,013 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 19:16:12,014 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 19:16:12,014 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,017 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:12,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:12,017 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:12,017 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 19:16:12,018 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 19:16:12,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,020 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:12,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:12,020 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:12,021 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 19:16:12,021 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 19:16:12,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,022 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-12-08 19:16:12,023 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:12,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:12,023 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:12,023 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 19:16:12,024 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 19:16:12,024 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:12,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:12,025 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,025 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 19:16:12,025 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 19:16:12,026 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 19:16:12,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:12,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:12,027 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:12,027 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 19:16:12,027 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 19:16:12,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:12,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:12,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:12,029 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 19:16:12,029 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 19:16:12,029 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,030 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:12,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:12,031 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,031 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 19:16:12,031 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 19:16:12,031 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 19:16:12,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,033 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:12,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:12,034 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,034 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 19:16:12,034 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 19:16:12,035 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 19:16:12,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,038 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:12,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:12,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:12,039 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 19:16:12,040 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 19:16:12,040 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,042 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:12,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:12,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:12,043 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 19:16:12,043 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 19:16:12,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,044 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-12-08 19:16:12,045 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:12,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:12,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:12,045 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 19:16:12,046 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 19:16:12,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:12,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:12,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,048 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 19:16:12,048 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 19:16:12,048 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-08 19:16:12,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:12,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:12,049 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:12,050 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 19:16:12,050 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 19:16:12,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,050 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,050 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:12,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:12,051 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:12,051 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 19:16:12,051 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 19:16:12,051 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:12,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:12,053 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,053 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 19:16:12,053 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 19:16:12,054 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-08 19:16:12,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,056 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:12,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:12,057 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,057 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 19:16:12,057 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 19:16:12,057 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-08 19:16:12,057 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,062 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:12,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:12,062 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:12,062 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 19:16:12,063 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 19:16:12,063 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:12,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 19:16:12,066 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:12,066 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 19:16:12,067 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 19:16:12,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,068 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-12-08 19:16:12,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:12,069 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:12,069 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 19:16:12,069 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:12,070 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 19:16:12,070 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 19:16:12,070 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,072 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:12,072 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:12,072 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 19:16:12,072 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,073 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 19:16:12,073 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 19:16:12,073 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 19:16:12,073 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:12,074 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:12,074 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 19:16:12,075 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:12,075 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 19:16:12,075 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 19:16:12,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:12,076 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:12,076 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 19:16:12,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:12,077 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 19:16:12,077 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 19:16:12,077 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,079 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:12,079 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:12,079 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 19:16:12,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,079 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 19:16:12,079 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 19:16:12,080 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 19:16:12,080 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,083 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:12,083 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:12,083 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 19:16:12,084 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,084 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 19:16:12,084 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 19:16:12,085 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 19:16:12,085 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,090 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:12,090 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:12,090 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 19:16:12,090 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:12,091 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 19:16:12,091 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 19:16:12,091 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:12,097 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:12,097 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 19:16:12,097 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:12,097 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 19:16:12,098 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 19:16:12,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,100 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-12-08 19:16:12,100 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:12,100 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:12,100 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-08 19:16:12,100 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:12,101 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 19:16:12,101 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 19:16:12,101 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:12,104 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:12,104 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-08 19:16:12,104 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,104 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 19:16:12,104 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 19:16:12,105 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 19:16:12,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,106 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:12,106 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:12,106 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-08 19:16:12,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:12,107 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 19:16:12,107 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 19:16:12,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,108 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:12,108 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:12,109 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-08 19:16:12,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:12,109 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 19:16:12,109 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 19:16:12,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:12,112 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:12,112 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-08 19:16:12,112 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,113 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 19:16:12,113 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 19:16:12,113 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 19:16:12,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,119 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:12,119 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:12,119 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-08 19:16:12,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,119 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 19:16:12,120 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 19:16:12,121 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 19:16:12,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:12,130 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:12,130 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-08 19:16:12,130 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:12,131 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 19:16:12,132 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 19:16:12,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,138 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:12,138 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:12,138 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-08 19:16:12,139 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:12,139 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 19:16:12,140 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 19:16:12,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,144 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-12-08 19:16:12,144 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:12,144 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:12,144 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 19:16:12,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:12,145 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 19:16:12,146 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 19:16:12,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,150 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:12,150 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:12,150 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 19:16:12,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,151 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 19:16:12,151 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 19:16:12,152 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-08 19:16:12,152 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,154 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:12,154 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:12,154 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 19:16:12,154 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:12,155 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 19:16:12,155 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 19:16:12,155 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:12,157 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:12,157 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 19:16:12,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:12,157 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 19:16:12,158 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 19:16:12,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,162 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:12,163 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:12,163 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 19:16:12,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,163 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 19:16:12,163 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 19:16:12,165 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-08 19:16:12,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:12,174 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:12,174 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 19:16:12,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,174 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 19:16:12,174 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 19:16:12,177 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-08 19:16:12,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,193 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:12,194 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:12,194 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 19:16:12,194 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:12,194 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 19:16:12,196 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 19:16:12,196 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:12,204 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:12,204 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 19:16:12,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:12,204 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 19:16:12,205 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 19:16:12,206 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,210 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-12-08 19:16:12,211 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:12,211 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:12,211 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 19:16:12,211 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:12,211 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 19:16:12,212 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 19:16:12,212 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:12,214 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:12,214 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 19:16:12,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,214 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 19:16:12,214 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 19:16:12,215 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 19:16:12,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,216 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:12,216 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:12,217 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 19:16:12,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:12,217 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 19:16:12,217 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 19:16:12,217 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,218 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:12,219 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:12,219 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 19:16:12,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:12,219 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 19:16:12,220 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 19:16:12,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,221 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,221 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:12,221 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:12,222 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 19:16:12,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,222 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 19:16:12,222 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 19:16:12,222 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 19:16:12,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,227 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,227 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:12,227 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:12,228 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 19:16:12,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,228 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 19:16:12,228 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 19:16:12,229 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 19:16:12,229 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,236 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:12,237 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:12,237 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 19:16:12,237 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:12,237 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 19:16:12,238 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 19:16:12,238 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,281 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:12,281 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:12,281 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 19:16:12,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:12,282 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 19:16:12,282 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 19:16:12,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,284 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-12-08 19:16:12,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:12,284 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:12,284 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 19:16:12,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:12,285 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-08 19:16:12,285 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 19:16:12,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,286 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:12,287 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:12,287 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 19:16:12,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,287 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 19:16:12,287 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-08 19:16:12,287 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 19:16:12,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,289 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:12,289 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:12,289 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 19:16:12,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:12,289 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-08 19:16:12,289 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 19:16:12,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:12,291 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:12,291 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 19:16:12,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:12,291 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-08 19:16:12,292 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 19:16:12,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:12,293 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:12,293 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 19:16:12,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,294 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 19:16:12,294 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-08 19:16:12,294 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 19:16:12,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 19:16:12,301 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:12,301 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 19:16:12,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,301 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 19:16:12,301 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-08 19:16:12,302 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 19:16:12,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,311 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:12,312 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:12,312 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 19:16:12,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:12,312 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-08 19:16:12,313 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 19:16:12,313 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,321 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-08 19:16:12,322 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 19:16:12,322 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 19:16:12,322 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 19:16:12,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 19:16:12,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 19:16:12,322 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-08 19:16:12,322 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 19:16:12,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 19:16:12,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 19:16:12,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 19:16:12,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 19:16:12,326 INFO L87 Difference]: Start difference. First operand 305 states and 405 transitions. cyclomatic complexity: 101 Second operand 3 states. [2018-12-08 19:16:12,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:16:12,579 INFO L93 Difference]: Finished difference Result 590 states and 749 transitions. [2018-12-08 19:16:12,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 19:16:12,580 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 590 states and 749 transitions. [2018-12-08 19:16:12,582 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2018-12-08 19:16:12,585 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 590 states to 590 states and 749 transitions. [2018-12-08 19:16:12,585 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 590 [2018-12-08 19:16:12,586 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 590 [2018-12-08 19:16:12,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 590 states and 749 transitions. [2018-12-08 19:16:12,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 19:16:12,587 INFO L705 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2018-12-08 19:16:12,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states and 749 transitions. [2018-12-08 19:16:12,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2018-12-08 19:16:12,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-12-08 19:16:12,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 749 transitions. [2018-12-08 19:16:12,599 INFO L728 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2018-12-08 19:16:12,599 INFO L608 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2018-12-08 19:16:12,599 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-08 19:16:12,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 590 states and 749 transitions. [2018-12-08 19:16:12,601 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2018-12-08 19:16:12,601 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 19:16:12,601 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 19:16:12,602 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 19:16:12,602 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-08 19:16:12,602 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-08 19:16:12,603 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-08 19:16:12,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:16:12,604 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-12-08 19:16:12,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 19:16:12,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 19:16:12,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:12,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:16:12,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:12,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 19:16:12,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 19:16:12,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:16:12,609 INFO L82 PathProgramCache]: Analyzing trace with hash -695559695, now seen corresponding path program 1 times [2018-12-08 19:16:12,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 19:16:12,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 19:16:12,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:12,609 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 19:16:12,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:12,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:16:12,664 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-08 19:16:12,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:16:12,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 19:16:12,664 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 19:16:12,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 19:16:12,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 19:16:12,665 INFO L87 Difference]: Start difference. First operand 590 states and 749 transitions. cyclomatic complexity: 160 Second operand 4 states. [2018-12-08 19:16:13,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:16:13,158 INFO L93 Difference]: Finished difference Result 1154 states and 1436 transitions. [2018-12-08 19:16:13,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 19:16:13,158 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1154 states and 1436 transitions. [2018-12-08 19:16:13,165 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1150 [2018-12-08 19:16:13,169 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1154 states to 1154 states and 1436 transitions. [2018-12-08 19:16:13,170 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1154 [2018-12-08 19:16:13,171 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1154 [2018-12-08 19:16:13,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1154 states and 1436 transitions. [2018-12-08 19:16:13,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 19:16:13,172 INFO L705 BuchiCegarLoop]: Abstraction has 1154 states and 1436 transitions. [2018-12-08 19:16:13,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states and 1436 transitions. [2018-12-08 19:16:13,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1151. [2018-12-08 19:16:13,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151 states. [2018-12-08 19:16:13,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1430 transitions. [2018-12-08 19:16:13,188 INFO L728 BuchiCegarLoop]: Abstraction has 1151 states and 1430 transitions. [2018-12-08 19:16:13,188 INFO L608 BuchiCegarLoop]: Abstraction has 1151 states and 1430 transitions. [2018-12-08 19:16:13,188 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-08 19:16:13,188 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1151 states and 1430 transitions. [2018-12-08 19:16:13,191 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1147 [2018-12-08 19:16:13,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 19:16:13,191 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 19:16:13,192 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 19:16:13,192 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-08 19:16:13,192 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-08 19:16:13,192 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-08 19:16:13,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:16:13,193 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-12-08 19:16:13,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 19:16:13,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 19:16:13,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:13,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:16:13,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:13,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 19:16:13,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 19:16:13,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:16:13,196 INFO L82 PathProgramCache]: Analyzing trace with hash -917902191, now seen corresponding path program 1 times [2018-12-08 19:16:13,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 19:16:13,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 19:16:13,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:13,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 19:16:13,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:13,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:16:13,214 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-08 19:16:13,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:16:13,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 19:16:13,215 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 19:16:13,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 19:16:13,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 19:16:13,215 INFO L87 Difference]: Start difference. First operand 1151 states and 1430 transitions. cyclomatic complexity: 281 Second operand 3 states. [2018-12-08 19:16:13,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:16:13,499 INFO L93 Difference]: Finished difference Result 1291 states and 1575 transitions. [2018-12-08 19:16:13,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 19:16:13,499 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1291 states and 1575 transitions. [2018-12-08 19:16:13,502 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2018-12-08 19:16:13,505 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1291 states to 1291 states and 1575 transitions. [2018-12-08 19:16:13,505 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1291 [2018-12-08 19:16:13,506 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1291 [2018-12-08 19:16:13,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1291 states and 1575 transitions. [2018-12-08 19:16:13,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 19:16:13,507 INFO L705 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2018-12-08 19:16:13,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states and 1575 transitions. [2018-12-08 19:16:13,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1291. [2018-12-08 19:16:13,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1291 states. [2018-12-08 19:16:13,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1575 transitions. [2018-12-08 19:16:13,517 INFO L728 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2018-12-08 19:16:13,517 INFO L608 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2018-12-08 19:16:13,517 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-08 19:16:13,517 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1291 states and 1575 transitions. [2018-12-08 19:16:13,519 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2018-12-08 19:16:13,520 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 19:16:13,520 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 19:16:13,521 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 19:16:13,521 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-08 19:16:13,521 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-08 19:16:13,521 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-08 19:16:13,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:16:13,521 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-12-08 19:16:13,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 19:16:13,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 19:16:13,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:13,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:16:13,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 19:16:13,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 19:16:13,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:16:13,524 INFO L82 PathProgramCache]: Analyzing trace with hash -925782543, now seen corresponding path program 1 times [2018-12-08 19:16:13,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 19:16:13,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 19:16:13,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:13,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 19:16:13,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:13,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:16:13,545 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-08 19:16:13,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:16:13,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 19:16:13,546 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 19:16:13,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 19:16:13,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 19:16:13,546 INFO L87 Difference]: Start difference. First operand 1291 states and 1575 transitions. cyclomatic complexity: 286 Second operand 3 states. [2018-12-08 19:16:13,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:16:13,801 INFO L93 Difference]: Finished difference Result 1290 states and 1468 transitions. [2018-12-08 19:16:13,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 19:16:13,801 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1290 states and 1468 transitions. [2018-12-08 19:16:13,804 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2018-12-08 19:16:13,807 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1290 states to 1290 states and 1468 transitions. [2018-12-08 19:16:13,807 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1290 [2018-12-08 19:16:13,807 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1290 [2018-12-08 19:16:13,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1290 states and 1468 transitions. [2018-12-08 19:16:13,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 19:16:13,808 INFO L705 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2018-12-08 19:16:13,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states and 1468 transitions. [2018-12-08 19:16:13,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1290. [2018-12-08 19:16:13,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1290 states. [2018-12-08 19:16:13,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1468 transitions. [2018-12-08 19:16:13,818 INFO L728 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2018-12-08 19:16:13,818 INFO L608 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2018-12-08 19:16:13,818 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-08 19:16:13,818 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1290 states and 1468 transitions. [2018-12-08 19:16:13,821 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2018-12-08 19:16:13,821 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 19:16:13,821 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 19:16:13,822 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 19:16:13,822 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-08 19:16:13,822 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-08 19:16:13,822 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-08 19:16:13,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:16:13,822 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-12-08 19:16:13,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 19:16:13,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 19:16:13,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:13,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:16:13,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 19:16:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 19:16:13,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:16:13,827 INFO L82 PathProgramCache]: Analyzing trace with hash -568851643, now seen corresponding path program 1 times [2018-12-08 19:16:13,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 19:16:13,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 19:16:13,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:13,828 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 19:16:13,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:13,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:16:13,865 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-08 19:16:13,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:16:13,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 19:16:13,866 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 19:16:13,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 19:16:13,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 19:16:13,866 INFO L87 Difference]: Start difference. First operand 1290 states and 1468 transitions. cyclomatic complexity: 180 Second operand 3 states. [2018-12-08 19:16:14,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:16:14,010 INFO L93 Difference]: Finished difference Result 1279 states and 1424 transitions. [2018-12-08 19:16:14,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 19:16:14,010 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1279 states and 1424 transitions. [2018-12-08 19:16:14,013 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1276 [2018-12-08 19:16:14,017 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1279 states to 1279 states and 1424 transitions. [2018-12-08 19:16:14,018 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1279 [2018-12-08 19:16:14,019 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1279 [2018-12-08 19:16:14,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1279 states and 1424 transitions. [2018-12-08 19:16:14,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 19:16:14,020 INFO L705 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2018-12-08 19:16:14,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states and 1424 transitions. [2018-12-08 19:16:14,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1279. [2018-12-08 19:16:14,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1279 states. [2018-12-08 19:16:14,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1424 transitions. [2018-12-08 19:16:14,036 INFO L728 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2018-12-08 19:16:14,036 INFO L608 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2018-12-08 19:16:14,036 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-08 19:16:14,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1279 states and 1424 transitions. [2018-12-08 19:16:14,040 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1276 [2018-12-08 19:16:14,040 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 19:16:14,040 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 19:16:14,040 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 19:16:14,041 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-08 19:16:14,041 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-08 19:16:14,042 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-08 19:16:14,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:16:14,042 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-12-08 19:16:14,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 19:16:14,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 19:16:14,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:14,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:16:14,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:14,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 19:16:14,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 19:16:14,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:16:14,046 INFO L82 PathProgramCache]: Analyzing trace with hash 2053340219, now seen corresponding path program 1 times [2018-12-08 19:16:14,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 19:16:14,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 19:16:14,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:14,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:16:14,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:14,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 19:16:14,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 19:16:14,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:16:14,087 INFO L82 PathProgramCache]: Analyzing trace with hash 41143549, now seen corresponding path program 1 times [2018-12-08 19:16:14,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 19:16:14,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 19:16:14,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:14,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:16:14,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:14,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:16:14,408 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-08 19:16:14,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:16:14,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 19:16:15,077 WARN L180 SmtUtils]: Spent 657.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2018-12-08 19:16:15,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 19:16:15,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-12-08 19:16:15,147 INFO L87 Difference]: Start difference. First operand 1279 states and 1424 transitions. cyclomatic complexity: 148 Second operand 10 states. [2018-12-08 19:16:15,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:16:15,627 INFO L93 Difference]: Finished difference Result 1225 states and 1369 transitions. [2018-12-08 19:16:15,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 19:16:15,627 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1225 states and 1369 transitions. [2018-12-08 19:16:15,632 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1136 [2018-12-08 19:16:15,635 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1225 states to 1191 states and 1335 transitions. [2018-12-08 19:16:15,636 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1191 [2018-12-08 19:16:15,637 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1191 [2018-12-08 19:16:15,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1191 states and 1335 transitions. [2018-12-08 19:16:15,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 19:16:15,638 INFO L705 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2018-12-08 19:16:15,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states and 1335 transitions. [2018-12-08 19:16:15,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1191. [2018-12-08 19:16:15,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1191 states. [2018-12-08 19:16:15,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1335 transitions. [2018-12-08 19:16:15,652 INFO L728 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2018-12-08 19:16:15,652 INFO L608 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2018-12-08 19:16:15,652 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-08 19:16:15,652 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1191 states and 1335 transitions. [2018-12-08 19:16:15,656 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1136 [2018-12-08 19:16:15,656 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 19:16:15,656 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 19:16:15,657 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-08 19:16:15,657 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:16:15,657 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-08 19:16:15,657 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-08 19:16:15,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:16:15,657 INFO L82 PathProgramCache]: Analyzing trace with hash 889694475, now seen corresponding path program 1 times [2018-12-08 19:16:15,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 19:16:15,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 19:16:15,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:15,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:16:15,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:15,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 19:16:15,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 19:16:15,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:16:15,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1141479969, now seen corresponding path program 1 times [2018-12-08 19:16:15,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 19:16:15,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 19:16:15,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:15,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:16:15,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:15,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 19:16:15,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 19:16:15,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:16:15,669 INFO L82 PathProgramCache]: Analyzing trace with hash 2047121707, now seen corresponding path program 1 times [2018-12-08 19:16:15,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 19:16:15,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 19:16:15,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:15,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:16:15,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:16:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 19:16:15,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 19:16:15,811 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 19:16:15,811 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 19:16:15,811 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 19:16:15,811 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 19:16:15,811 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-08 19:16:15,811 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 19:16:15,811 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 19:16:15,811 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 19:16:15,811 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label57_true-unreach-call_false-termination.c_Iteration8_Lasso [2018-12-08 19:16:15,811 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 19:16:15,811 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 19:16:15,813 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-08 19:16:15,814 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-08 19:16:15,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 19:16:15,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 19:16:15,818 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-08 19:16:15,819 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-08 19:16:15,820 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-08 19:16:15,822 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-08 19:16:15,823 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-08 19:16:15,824 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-08 19:16:15,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 19:16:15,826 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-08 19:16:15,828 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-08 19:16:15,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 19:16:15,831 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-08 19:16:15,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 19:16:15,838 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-08 19:16:15,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 19:16:15,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 19:16:15,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 19:16:15,858 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-08 19:16:15,979 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 19:16:15,979 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6650dba-e3c7-438c-83d0-f3931691c183/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-08 19:16:15,982 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 19:16:15,983 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 19:16:15,984 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 19:16:15,984 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_d6650dba-e3c7-438c-83d0-f3931691c183/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-08 19:16:15,999 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 19:16:16,000 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 19:16:16,001 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 19:16:16,001 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_d6650dba-e3c7-438c-83d0-f3931691c183/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-08 19:16:16,016 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 19:16:16,016 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 19:16:16,018 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 19:16:16,018 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_d6650dba-e3c7-438c-83d0-f3931691c183/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-08 19:16:16,033 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 19:16:16,034 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 19:16:16,035 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 19:16:16,035 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_d6650dba-e3c7-438c-83d0-f3931691c183/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-08 19:16:16,050 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 19:16:16,050 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 19:16:16,052 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 19:16:16,052 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_d6650dba-e3c7-438c-83d0-f3931691c183/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-08 19:16:16,066 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 19:16:16,067 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 19:16:16,068 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 19:16:16,068 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_d6650dba-e3c7-438c-83d0-f3931691c183/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-08 19:16:16,083 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 19:16:16,083 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 19:16:16,085 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 19:16:16,085 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_d6650dba-e3c7-438c-83d0-f3931691c183/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-08 19:16:16,100 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 19:16:16,100 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 19:16:16,102 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 19:16:16,102 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_d6650dba-e3c7-438c-83d0-f3931691c183/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-08 19:16:16,117 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 19:16:16,117 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 19:16:16,119 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 19:16:16,119 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_d6650dba-e3c7-438c-83d0-f3931691c183/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-08 19:16:16,134 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 19:16:16,134 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 19:16:16,136 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 19:16:16,136 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_d6650dba-e3c7-438c-83d0-f3931691c183/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-08 19:16:16,151 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 19:16:16,151 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 19:16:16,152 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 19:16:16,153 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_d6650dba-e3c7-438c-83d0-f3931691c183/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-08 19:16:16,167 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 19:16:16,167 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 19:16:16,169 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 19:16:16,169 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_d6650dba-e3c7-438c-83d0-f3931691c183/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-08 19:16:16,184 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 19:16:16,184 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 19:16:16,186 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 19:16:16,186 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_d6650dba-e3c7-438c-83d0-f3931691c183/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-08 19:16:16,201 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 19:16:16,201 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 19:16:16,203 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 19:16:16,203 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_d6650dba-e3c7-438c-83d0-f3931691c183/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-08 19:16:16,217 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 19:16:16,217 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 19:16:16,219 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 19:16:16,219 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_d6650dba-e3c7-438c-83d0-f3931691c183/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-08 19:16:16,233 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 19:16:16,234 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6650dba-e3c7-438c-83d0-f3931691c183/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-08 19:16:16,251 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-08 19:16:16,251 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 19:16:16,400 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 19:16:16,400 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_d6650dba-e3c7-438c-83d0-f3931691c183/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-08 19:16:16,416 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 19:16:16,416 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 19:16:16,418 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 19:16:16,418 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_d6650dba-e3c7-438c-83d0-f3931691c183/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-08 19:16:16,432 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 19:16:16,432 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 19:16:16,434 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 19:16:16,434 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_d6650dba-e3c7-438c-83d0-f3931691c183/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-08 19:16:16,449 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 19:16:16,449 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6650dba-e3c7-438c-83d0-f3931691c183/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-08 19:16:16,465 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-08 19:16:16,465 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 19:16:16,598 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 19:16:16,598 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_d6650dba-e3c7-438c-83d0-f3931691c183/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-08 19:16:16,613 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 19:16:16,613 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 19:16:16,615 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 19:16:16,615 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_d6650dba-e3c7-438c-83d0-f3931691c183/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-08 19:16:16,630 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 19:16:16,630 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 19:16:16,632 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 19:16:16,632 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a28~0=0} Honda state: {~a28~0=10} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2018-12-08 19:16:16,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.12 07:16:16 BoogieIcfgContainer [2018-12-08 19:16:16,662 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-08 19:16:16,662 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 19:16:16,663 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 19:16:16,663 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 19:16:16,663 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 07:16:09" (3/4) ... [2018-12-08 19:16:16,665 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-12-08 19:16:16,696 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d6650dba-e3c7-438c-83d0-f3931691c183/bin-2019/uautomizer/witness.graphml [2018-12-08 19:16:16,696 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 19:16:16,696 INFO L168 Benchmark]: Toolchain (without parser) took 8148.49 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 513.3 MB). Free memory was 945.2 MB in the beginning and 1.1 GB in the end (delta: -170.4 MB). Peak memory consumption was 342.9 MB. Max. memory is 11.5 GB. [2018-12-08 19:16:16,697 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 19:16:16,697 INFO L168 Benchmark]: CACSL2BoogieTranslator took 311.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.0 MB). Free memory was 945.2 MB in the beginning and 1.1 GB in the end (delta: -150.1 MB). Peak memory consumption was 34.8 MB. Max. memory is 11.5 GB. [2018-12-08 19:16:16,697 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-08 19:16:16,698 INFO L168 Benchmark]: Boogie Preprocessor took 28.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-08 19:16:16,698 INFO L168 Benchmark]: RCFGBuilder took 584.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 981.2 MB in the end (delta: 103.4 MB). Peak memory consumption was 103.4 MB. Max. memory is 11.5 GB. [2018-12-08 19:16:16,698 INFO L168 Benchmark]: BuchiAutomizer took 7147.45 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 406.3 MB). Free memory was 981.2 MB in the beginning and 1.1 GB in the end (delta: -134.5 MB). Peak memory consumption was 380.0 MB. Max. memory is 11.5 GB. [2018-12-08 19:16:16,698 INFO L168 Benchmark]: Witness Printer took 33.35 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 19:16:16,700 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 311.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.0 MB). Free memory was 945.2 MB in the beginning and 1.1 GB in the end (delta: -150.1 MB). Peak memory consumption was 34.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 584.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 981.2 MB in the end (delta: 103.4 MB). Peak memory consumption was 103.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7147.45 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 406.3 MB). Free memory was 981.2 MB in the beginning and 1.1 GB in the end (delta: -134.5 MB). Peak memory consumption was 380.0 MB. Max. memory is 11.5 GB. * Witness Printer took 33.35 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (7 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.7 modules have a trivial ranking function, the largest among these consists of 10 locations. The remainder module has 1191 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.0s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 4.4s. 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@19b226c4=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@27e88a9=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@19b226c4=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@27e88a9=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@19b226c4=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@27e88a9=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...