./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label23_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c58413bc-4116-42b3-a54d-fad677d1f1be/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c58413bc-4116-42b3-a54d-fad677d1f1be/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c58413bc-4116-42b3-a54d-fad677d1f1be/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c58413bc-4116-42b3-a54d-fad677d1f1be/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label23_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c58413bc-4116-42b3-a54d-fad677d1f1be/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c58413bc-4116-42b3-a54d-fad677d1f1be/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a07d46acee19a1bf676413a71857b7cd94a5f704 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 09:45:15,647 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 09:45:15,648 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 09:45:15,656 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 09:45:15,656 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 09:45:15,657 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 09:45:15,658 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 09:45:15,659 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 09:45:15,660 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 09:45:15,661 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 09:45:15,661 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 09:45:15,662 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 09:45:15,662 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 09:45:15,663 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 09:45:15,664 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 09:45:15,664 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 09:45:15,665 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 09:45:15,666 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 09:45:15,667 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 09:45:15,668 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 09:45:15,669 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 09:45:15,670 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 09:45:15,672 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 09:45:15,672 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 09:45:15,672 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 09:45:15,673 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 09:45:15,674 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 09:45:15,674 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 09:45:15,675 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 09:45:15,676 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 09:45:15,676 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 09:45:15,676 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 09:45:15,677 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 09:45:15,677 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 09:45:15,678 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 09:45:15,678 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 09:45:15,678 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c58413bc-4116-42b3-a54d-fad677d1f1be/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 09:45:15,690 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 09:45:15,690 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 09:45:15,691 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 09:45:15,691 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 09:45:15,691 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 09:45:15,692 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 09:45:15,692 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 09:45:15,692 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 09:45:15,692 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 09:45:15,692 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 09:45:15,699 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 09:45:15,699 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 09:45:15,699 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 09:45:15,699 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 09:45:15,700 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 09:45:15,700 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 09:45:15,700 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 09:45:15,700 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 09:45:15,700 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 09:45:15,700 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 09:45:15,701 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 09:45:15,701 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 09:45:15,701 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 09:45:15,701 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 09:45:15,701 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 09:45:15,701 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 09:45:15,702 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 09:45:15,702 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 09:45:15,702 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 09:45:15,702 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 09:45:15,702 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 09:45:15,703 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 09:45:15,703 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_c58413bc-4116-42b3-a54d-fad677d1f1be/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a07d46acee19a1bf676413a71857b7cd94a5f704 [2018-11-18 09:45:15,727 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 09:45:15,735 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 09:45:15,737 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 09:45:15,738 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 09:45:15,739 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 09:45:15,739 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c58413bc-4116-42b3-a54d-fad677d1f1be/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label23_true-unreach-call_false-termination.c [2018-11-18 09:45:15,776 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c58413bc-4116-42b3-a54d-fad677d1f1be/bin-2019/uautomizer/data/1bda3ee1e/02800d3f49504f13851187420c01a60e/FLAG447e79b87 [2018-11-18 09:45:16,246 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 09:45:16,247 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c58413bc-4116-42b3-a54d-fad677d1f1be/sv-benchmarks/c/eca-rers2012/Problem02_label23_true-unreach-call_false-termination.c [2018-11-18 09:45:16,257 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c58413bc-4116-42b3-a54d-fad677d1f1be/bin-2019/uautomizer/data/1bda3ee1e/02800d3f49504f13851187420c01a60e/FLAG447e79b87 [2018-11-18 09:45:16,755 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c58413bc-4116-42b3-a54d-fad677d1f1be/bin-2019/uautomizer/data/1bda3ee1e/02800d3f49504f13851187420c01a60e [2018-11-18 09:45:16,757 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 09:45:16,758 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 09:45:16,759 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 09:45:16,759 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 09:45:16,761 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 09:45:16,762 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:45:16" (1/1) ... [2018-11-18 09:45:16,764 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49fe5536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:45:16, skipping insertion in model container [2018-11-18 09:45:16,764 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:45:16" (1/1) ... [2018-11-18 09:45:16,771 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 09:45:16,805 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 09:45:17,048 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:45:17,052 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 09:45:17,119 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:45:17,132 INFO L195 MainTranslator]: Completed translation [2018-11-18 09:45:17,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:45:17 WrapperNode [2018-11-18 09:45:17,132 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 09:45:17,133 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 09:45:17,133 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 09:45:17,133 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 09:45:17,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:45:17" (1/1) ... [2018-11-18 09:45:17,207 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:45:17" (1/1) ... [2018-11-18 09:45:17,234 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 09:45:17,234 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 09:45:17,235 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 09:45:17,235 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 09:45:17,242 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:45:17" (1/1) ... [2018-11-18 09:45:17,242 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:45:17" (1/1) ... [2018-11-18 09:45:17,245 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:45:17" (1/1) ... [2018-11-18 09:45:17,245 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:45:17" (1/1) ... [2018-11-18 09:45:17,258 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:45:17" (1/1) ... [2018-11-18 09:45:17,267 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:45:17" (1/1) ... [2018-11-18 09:45:17,270 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:45:17" (1/1) ... [2018-11-18 09:45:17,275 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 09:45:17,276 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 09:45:17,276 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 09:45:17,276 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 09:45:17,278 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:45:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c58413bc-4116-42b3-a54d-fad677d1f1be/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:45:17,332 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 09:45:17,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 09:45:17,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 09:45:18,175 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 09:45:18,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:45:18 BoogieIcfgContainer [2018-11-18 09:45:18,176 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 09:45:18,176 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 09:45:18,176 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 09:45:18,181 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 09:45:18,181 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 09:45:18,182 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 09:45:16" (1/3) ... [2018-11-18 09:45:18,182 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69bf783c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 09:45:18, skipping insertion in model container [2018-11-18 09:45:18,183 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 09:45:18,183 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:45:17" (2/3) ... [2018-11-18 09:45:18,183 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69bf783c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 09:45:18, skipping insertion in model container [2018-11-18 09:45:18,183 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 09:45:18,183 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:45:18" (3/3) ... [2018-11-18 09:45:18,185 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label23_true-unreach-call_false-termination.c [2018-11-18 09:45:18,227 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 09:45:18,228 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 09:45:18,228 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 09:45:18,228 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 09:45:18,228 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 09:45:18,228 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 09:45:18,228 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 09:45:18,228 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 09:45:18,229 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 09:45:18,246 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-18 09:45:18,273 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-18 09:45:18,273 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:45:18,273 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:45:18,280 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 09:45:18,281 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 09:45:18,281 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 09:45:18,281 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-18 09:45:18,287 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-18 09:45:18,288 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:45:18,288 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:45:18,289 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 09:45:18,289 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 09:45:18,295 INFO L794 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 167#L606-3true [2018-11-18 09:45:18,295 INFO L796 eck$LassoCheckResult]: Loop: 167#L606-3true assume true; 163#L606-1true assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 65#L611true assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 192#L30true assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 207#L597true main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 167#L606-3true [2018-11-18 09:45:18,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:45:18,300 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 09:45:18,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:45:18,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:45:18,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:45:18,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:45:18,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:45:18,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:45:18,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:45:18,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:45:18,378 INFO L82 PathProgramCache]: Analyzing trace with hash 34545679, now seen corresponding path program 1 times [2018-11-18 09:45:18,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:45:18,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:45:18,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:45:18,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:45:18,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:45:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:45:18,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:45:18,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:45:18,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1805985165, now seen corresponding path program 1 times [2018-11-18 09:45:18,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:45:18,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:45:18,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:45:18,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:45:18,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:45:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:45:18,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:45:18,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:45:18,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 09:45:18,560 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:45:18,560 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:45:18,561 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:45:18,561 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:45:18,561 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 09:45:18,561 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:45:18,561 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:45:18,561 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:45:18,561 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label23_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-18 09:45:18,561 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:45:18,562 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:45:18,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:45:18,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:45:18,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:45:18,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:45:18,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:45:18,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:45:18,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:45:18,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:45:18,793 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:45:18,794 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c58413bc-4116-42b3-a54d-fad677d1f1be/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:45:18,798 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:45:18,798 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:45:18,806 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:45:18,806 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_c58413bc-4116-42b3-a54d-fad677d1f1be/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:45:18,825 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:45:18,825 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:45:18,836 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:45:18,836 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_c58413bc-4116-42b3-a54d-fad677d1f1be/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:45:18,861 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:45:18,861 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:45:18,863 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:45:18,863 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_c58413bc-4116-42b3-a54d-fad677d1f1be/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:45:18,884 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:45:18,884 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:45:18,891 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:45:18,892 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_c58413bc-4116-42b3-a54d-fad677d1f1be/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-18 09:45:18,924 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:45:18,924 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:45:18,935 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:45:18,935 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_c58413bc-4116-42b3-a54d-fad677d1f1be/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) [2018-11-18 09:45:18,966 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:45:18,966 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:45:18,979 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:45:18,979 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_c58413bc-4116-42b3-a54d-fad677d1f1be/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) [2018-11-18 09:45:19,007 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:45:19,007 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:45:19,024 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:45:19,024 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_c58413bc-4116-42b3-a54d-fad677d1f1be/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:45:19,051 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:45:19,052 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c58413bc-4116-42b3-a54d-fad677d1f1be/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:45:19,075 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 09:45:19,075 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:45:19,107 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 09:45:19,109 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:45:19,109 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:45:19,109 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:45:19,109 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:45:19,109 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 09:45:19,109 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:45:19,110 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:45:19,110 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:45:19,110 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label23_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-18 09:45:19,110 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:45:19,110 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:45:19,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:45:19,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:45:19,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:45:19,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:45:19,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:45:19,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:45:19,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:45:19,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:45:19,373 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:45:19,377 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 09:45:19,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:19,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:19,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:45:19,383 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:45:19,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,396 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:19,397 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:19,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:45:19,398 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:45:19,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:19,401 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,402 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 09:45:19,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:45:19,403 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:45:19,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,422 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:19,423 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:19,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:45:19,424 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:45:19,424 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,429 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:19,430 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:19,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:45:19,431 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:45:19,431 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,433 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:19,434 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:19,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:45:19,435 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:45:19,435 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,437 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,437 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:19,438 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:19,438 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:45:19,439 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:45:19,439 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,440 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,440 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,441 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:19,441 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,441 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:45:19,441 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:45:19,442 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:45:19,442 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,446 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,446 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-18 09:45:19,447 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:19,447 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:19,448 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:45:19,449 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:45:19,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,456 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:19,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:19,457 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:45:19,458 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:45:19,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,460 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:19,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,462 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 09:45:19,462 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:45:19,464 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 09:45:19,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:19,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:19,481 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:45:19,482 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:45:19,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:19,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:19,487 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:45:19,487 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:45:19,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:19,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:19,491 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:45:19,491 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:45:19,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:19,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:19,495 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:45:19,495 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:45:19,495 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,497 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:19,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,498 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:45:19,498 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:45:19,498 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:45:19,499 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,502 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-18 09:45:19,502 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:19,503 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:19,504 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:45:19,504 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:45:19,504 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:19,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:19,511 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:45:19,512 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:45:19,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:19,515 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,516 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 09:45:19,516 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:45:19,518 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 09:45:19,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,532 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:19,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:19,533 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:45:19,554 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:45:19,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,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-11-18 09:45:19,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:19,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:19,559 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:45:19,560 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:45:19,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,562 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:19,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:19,563 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:45:19,567 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:45:19,567 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:19,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:19,571 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:45:19,571 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:45:19,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:19,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,573 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:45:19,573 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:45:19,574 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:45:19,574 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,581 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-18 09:45:19,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:19,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:19,584 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:45:19,585 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:45:19,586 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,592 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:19,593 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:19,593 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:45:19,594 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:45:19,594 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,596 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:19,597 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,597 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 09:45:19,597 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:45:19,598 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 09:45:19,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,610 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:19,610 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:19,611 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:45:19,611 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:45:19,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:19,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:19,615 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:45:19,616 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:45:19,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,618 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:19,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:19,619 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:45:19,619 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:45:19,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:19,622 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:19,622 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:45:19,622 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:45:19,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,623 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:19,624 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,624 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:45:19,624 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:45:19,625 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 09:45:19,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,628 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,628 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-18 09:45:19,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,629 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:19,629 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:45:19,629 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:19,630 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:45:19,631 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:45:19,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,641 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,642 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,642 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:19,642 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:45:19,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:19,643 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:45:19,643 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:45:19,643 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,646 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:19,647 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:45:19,647 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,647 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 09:45:19,647 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:45:19,649 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 09:45:19,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,672 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,673 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:19,673 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:45:19,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:19,673 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:45:19,674 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:45:19,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,678 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:19,678 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:45:19,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:19,679 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:45:19,679 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:45:19,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,681 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,682 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:19,682 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:45:19,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:19,682 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:45:19,683 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:45:19,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,686 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:19,686 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:45:19,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:19,686 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:45:19,686 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:45:19,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,688 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:19,688 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:45:19,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,688 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:45:19,688 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:45:19,689 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:45:19,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,694 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-18 09:45:19,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,694 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:19,695 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 09:45:19,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:19,695 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:45:19,696 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:45:19,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,709 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:19,709 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 09:45:19,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:19,709 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:45:19,710 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:45:19,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,714 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:19,714 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 09:45:19,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,714 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 09:45:19,714 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:45:19,717 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 09:45:19,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,745 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:19,746 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 09:45:19,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:19,746 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:45:19,749 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:45:19,749 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,756 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:19,756 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 09:45:19,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:19,756 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:45:19,757 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:45:19,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,760 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,760 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:19,761 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 09:45:19,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:19,761 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:45:19,761 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:45:19,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,765 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:19,765 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 09:45:19,766 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:19,766 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:45:19,766 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:45:19,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,768 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:19,768 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 09:45:19,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,769 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:45:19,769 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:45:19,770 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:45:19,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,778 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-18 09:45:19,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,780 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:19,781 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:45:19,781 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:19,781 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:45:19,783 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:45:19,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,795 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:19,795 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:45:19,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:19,796 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:45:19,797 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:45:19,797 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,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-11-18 09:45:19,802 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:19,802 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:45:19,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,803 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 09:45:19,803 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:45:19,807 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 09:45:19,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,840 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,841 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:19,841 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:45:19,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:19,841 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:45:19,842 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:45:19,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,849 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:19,849 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:45:19,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:19,849 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:45:19,850 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:45:19,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,856 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:19,856 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:45:19,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:19,856 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:45:19,857 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:45:19,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,862 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:19,863 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:45:19,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:19,863 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:45:19,864 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:45:19,864 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,865 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:19,865 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:45:19,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,866 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:45:19,866 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:45:19,868 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 09:45:19,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,877 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-18 09:45:19,877 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,877 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:19,877 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:45:19,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:19,878 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:45:19,879 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:45:19,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,888 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:19,888 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:45:19,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:19,889 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:45:19,889 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:45:19,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,892 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:19,892 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:45:19,892 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,892 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 09:45:19,892 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:45:19,893 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 09:45:19,893 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,909 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,911 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:19,911 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:45:19,911 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:19,911 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:45:19,912 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:45:19,912 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,916 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,916 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:19,916 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:45:19,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:19,917 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:45:19,917 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:45:19,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,919 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:19,920 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:45:19,920 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:19,920 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:45:19,920 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:45:19,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,922 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,923 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:19,923 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:45:19,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:19,923 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:45:19,923 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:45:19,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,925 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,926 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:19,926 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:45:19,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,926 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:45:19,926 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:45:19,927 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:45:19,927 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,932 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,932 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-18 09:45:19,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,933 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:19,933 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:45:19,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:19,934 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 09:45:19,935 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:45:19,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,964 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,965 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:19,965 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:45:19,965 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:19,965 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 09:45:19,966 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:45:19,966 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:19,968 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:19,969 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:19,969 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:19,969 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:45:19,969 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:19,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:19,970 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 09:45:19,970 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 09:45:19,972 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-18 09:45:19,972 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:20,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:20,043 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:20,044 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:20,044 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:45:20,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:20,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:20,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:20,044 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 09:45:20,045 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:45:20,045 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:20,053 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:20,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-11-18 09:45:20,053 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:20,053 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:45:20,054 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:20,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:20,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:20,054 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 09:45:20,054 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:45:20,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:20,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:20,058 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:20,059 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:20,059 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:45:20,059 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:20,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:20,059 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:20,060 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 09:45:20,060 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:45:20,060 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:20,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:20,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:20,063 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:20,063 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:45:20,064 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:20,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:20,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:20,064 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 09:45:20,064 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:45:20,065 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:20,066 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:20,067 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:20,067 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:20,067 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:45:20,067 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:20,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:20,068 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:45:20,068 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 09:45:20,069 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 09:45:20,069 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:20,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:20,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:45:20,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:45:20,091 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 3 states. [2018-11-18 09:45:20,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:45:20,647 INFO L93 Difference]: Finished difference Result 381 states and 548 transitions. [2018-11-18 09:45:20,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:45:20,649 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 381 states and 548 transitions. [2018-11-18 09:45:20,652 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 372 [2018-11-18 09:45:20,657 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 381 states to 374 states and 541 transitions. [2018-11-18 09:45:20,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 374 [2018-11-18 09:45:20,659 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 374 [2018-11-18 09:45:20,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 374 states and 541 transitions. [2018-11-18 09:45:20,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 09:45:20,662 INFO L705 BuchiCegarLoop]: Abstraction has 374 states and 541 transitions. [2018-11-18 09:45:20,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states and 541 transitions. [2018-11-18 09:45:20,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2018-11-18 09:45:20,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-11-18 09:45:20,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 539 transitions. [2018-11-18 09:45:20,692 INFO L728 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-18 09:45:20,692 INFO L608 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-18 09:45:20,692 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 09:45:20,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 373 states and 539 transitions. [2018-11-18 09:45:20,694 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 371 [2018-11-18 09:45:20,694 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:45:20,694 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:45:20,695 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 09:45:20,695 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:45:20,695 INFO L794 eck$LassoCheckResult]: Stem: 751#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 631#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 632#L606-3 [2018-11-18 09:45:20,695 INFO L796 eck$LassoCheckResult]: Loop: 632#L606-3 assume true; 854#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 732#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 733#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 878#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 759#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 694#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 695#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 849#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 633#L54 assume (((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0);~a28~0 := 7;~a11~0 := 1;~a25~0 := 0;calculate_output_#res := -1; 634#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 632#L606-3 [2018-11-18 09:45:20,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:45:20,695 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-18 09:45:20,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:45:20,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:45:20,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:45:20,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:45:20,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:45:20,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:45:20,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:45:20,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:45:20,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1956321088, now seen corresponding path program 1 times [2018-11-18 09:45:20,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:45:20,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:45:20,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:45:20,703 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:45:20,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:45:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:45:20,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:45:20,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:45:20,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1962170302, now seen corresponding path program 1 times [2018-11-18 09:45:20,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:45:20,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:45:20,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:45:20,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:45:20,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:45:20,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:45:20,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:45:20,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:45:20,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 09:45:20,836 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:45:20,836 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:45:20,836 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:45:20,837 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:45:20,837 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 09:45:20,837 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:45:20,837 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:45:20,837 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:45:20,837 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label23_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-18 09:45:20,837 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:45:20,837 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:45:20,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-11-18 09:45:20,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:45:20,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:45:20,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:45:20,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:45:20,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:45:20,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:45:20,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:45:20,971 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:45:20,971 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c58413bc-4116-42b3-a54d-fad677d1f1be/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:45:20,979 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:45:20,979 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:45:20,982 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:45:20,982 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_c58413bc-4116-42b3-a54d-fad677d1f1be/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:45:21,007 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:45:21,008 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:45:21,010 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:45:21,011 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_c58413bc-4116-42b3-a54d-fad677d1f1be/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:45:21,027 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:45:21,027 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:45:21,030 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:45:21,030 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_c58413bc-4116-42b3-a54d-fad677d1f1be/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:45:21,046 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:45:21,046 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:45:21,048 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:45:21,048 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_c58413bc-4116-42b3-a54d-fad677d1f1be/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:45:21,064 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:45:21,064 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:45:21,067 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:45:21,067 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_c58413bc-4116-42b3-a54d-fad677d1f1be/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:45:21,095 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:45:21,095 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c58413bc-4116-42b3-a54d-fad677d1f1be/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:45:21,114 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 09:45:21,115 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:45:21,137 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 09:45:21,138 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:45:21,138 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:45:21,138 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:45:21,138 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:45:21,138 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 09:45:21,138 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:45:21,139 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:45:21,139 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:45:21,139 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label23_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-18 09:45:21,139 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:45:21,139 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:45:21,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:45:21,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:45:21,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:45:21,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:45:21,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:45:21,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:45:21,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:45:21,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:45:21,315 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:45:21,315 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 09:45:21,316 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:21,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:21,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:45:21,317 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:45:21,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:21,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:21,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:45:21,321 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:45:21,321 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:21,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,323 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:45:21,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:45:21,323 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:45:21,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,324 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:21,324 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:21,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:45:21,325 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:45:21,325 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,325 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:21,326 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:21,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:45:21,326 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:45:21,326 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:21,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,328 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:45:21,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:45:21,328 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:45:21,328 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:21,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,330 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:45:21,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:45:21,330 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:45:21,331 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,334 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:21,334 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:21,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:45:21,335 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:45:21,335 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,336 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-18 09:45:21,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:21,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:21,337 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:45:21,338 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:45:21,338 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,338 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:21,340 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:21,340 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:45:21,340 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:45:21,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:21,342 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,342 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:45:21,342 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:45:21,349 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:45:21,349 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,350 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,350 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:21,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,351 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:21,351 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:45:21,351 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:45:21,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,352 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:21,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:21,353 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:45:21,353 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:45:21,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:21,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,355 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:45:21,355 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:45:21,355 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:45:21,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,357 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:21,358 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,358 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:45:21,358 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:45:21,359 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:45:21,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,361 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,362 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:21,362 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:21,362 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:45:21,363 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:45:21,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,365 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-18 09:45:21,366 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:21,366 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:21,366 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:45:21,367 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:45:21,367 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:21,368 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:21,369 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:45:21,369 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:45:21,369 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:21,372 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,373 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:45:21,373 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:45:21,373 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:45:21,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:21,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:21,374 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:45:21,375 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:45:21,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:21,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:21,376 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:45:21,376 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:45:21,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:21,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,378 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:45:21,378 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:45:21,378 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:45:21,379 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:21,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,383 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:45:21,383 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:45:21,384 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:45:21,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:21,388 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:21,389 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:45:21,389 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:45:21,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,393 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-18 09:45:21,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:21,393 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:21,393 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:45:21,394 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:45:21,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,396 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:21,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:21,396 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:45:21,397 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:45:21,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:21,400 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,400 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:45:21,400 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:45:21,400 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 09:45:21,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:21,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:21,402 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:45:21,402 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:45:21,402 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,403 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:21,403 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:21,404 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:45:21,404 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:45:21,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:21,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,406 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:45:21,406 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:45:21,407 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 09:45:21,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:21,410 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,410 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:45:21,410 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:45:21,411 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 09:45:21,411 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:45:21,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:21,416 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:45:21,417 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:45:21,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,420 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-18 09:45:21,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,420 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:21,420 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:45:21,421 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:21,421 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:45:21,421 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:45:21,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,423 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,423 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,424 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:21,424 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:45:21,424 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:21,424 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:45:21,425 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:45:21,425 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,427 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,427 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,428 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:21,428 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:45:21,428 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,428 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:45:21,428 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:45:21,429 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:45:21,429 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,430 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,430 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:21,430 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:45:21,430 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:21,430 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:45:21,431 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:45:21,431 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,432 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,432 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:21,432 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:45:21,432 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:21,432 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:45:21,433 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:45:21,433 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,435 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,435 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:21,435 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:45:21,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,435 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:45:21,435 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:45:21,436 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:45:21,436 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,439 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,439 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,440 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:21,440 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:45:21,440 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,440 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:45:21,440 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:45:21,441 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:45:21,441 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,447 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,447 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,447 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:21,447 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:45:21,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:21,448 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:45:21,449 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:45:21,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,452 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,452 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-18 09:45:21,452 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,452 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:21,452 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 09:45:21,452 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:21,453 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:45:21,453 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:45:21,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,456 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,456 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:21,457 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 09:45:21,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:21,457 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:45:21,458 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:45:21,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,462 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:21,462 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 09:45:21,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,462 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:45:21,462 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:45:21,463 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:45:21,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,464 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:21,464 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 09:45:21,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:21,465 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:45:21,465 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:45:21,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,466 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,467 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:21,467 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 09:45:21,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:21,467 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:45:21,468 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:45:21,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,470 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,470 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:21,471 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 09:45:21,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,471 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:45:21,471 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:45:21,472 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:45:21,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,477 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:21,478 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 09:45:21,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,478 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:45:21,478 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:45:21,479 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:45:21,480 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,488 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:21,488 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 09:45:21,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:21,488 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:45:21,489 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:45:21,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,493 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-18 09:45:21,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,493 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:21,494 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:45:21,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:21,494 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:45:21,495 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:45:21,495 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,498 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,498 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:21,499 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:45:21,499 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:21,499 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:45:21,500 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:45:21,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,505 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:21,505 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:45:21,505 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,506 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:45:21,506 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:45:21,507 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 09:45:21,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,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-11-18 09:45:21,508 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:21,508 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:45:21,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:21,509 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:45:21,509 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:45:21,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,511 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:21,511 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:45:21,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:21,511 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:45:21,512 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:45:21,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,515 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:21,516 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:45:21,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,516 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:45:21,516 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:45:21,517 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 09:45:21,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,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-11-18 09:45:21,525 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:21,525 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:45:21,525 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,526 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:45:21,526 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:45:21,528 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 09:45:21,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,541 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,541 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,542 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:21,542 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:45:21,542 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:21,542 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:45:21,544 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:45:21,545 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,552 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-18 09:45:21,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,552 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:21,552 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:45:21,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:21,553 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:45:21,553 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:45:21,553 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,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-11-18 09:45:21,555 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:21,555 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:45:21,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:21,555 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:45:21,556 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:45:21,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,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-11-18 09:45:21,559 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:21,559 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:45:21,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,559 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:45:21,559 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:45:21,560 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:45:21,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,561 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:21,561 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:45:21,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:21,562 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:45:21,562 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:45:21,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,564 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:21,564 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:45:21,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:21,564 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:45:21,564 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:45:21,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,566 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,566 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:21,566 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:45:21,566 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,567 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:45:21,567 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:45:21,567 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:45:21,567 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,571 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,571 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,571 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:21,571 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:45:21,572 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,572 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:45:21,572 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:45:21,573 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:45:21,573 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,579 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,579 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:21,579 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:45:21,579 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:21,580 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:45:21,580 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:45:21,580 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,585 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-18 09:45:21,585 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,586 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:21,586 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:45:21,586 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:21,586 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 09:45:21,586 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:45:21,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,589 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,589 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:21,589 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:45:21,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:21,590 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 09:45:21,590 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:45:21,590 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,596 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,596 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:21,596 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:45:21,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,596 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:45:21,597 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 09:45:21,597 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 09:45:21,597 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,599 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:21,599 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:45:21,599 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:21,600 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 09:45:21,600 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:45:21,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,602 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,602 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,602 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:21,603 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:45:21,603 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:21,603 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 09:45:21,603 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:45:21,603 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,606 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,606 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:21,606 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:45:21,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,606 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:45:21,606 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 09:45:21,607 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 09:45:21,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,614 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,614 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:21,614 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:45:21,614 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,615 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:45:21,615 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 09:45:21,616 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 09:45:21,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,634 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,634 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:45:21,634 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:45:21,634 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:45:21,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:45:21,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:45:21,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:45:21,635 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 09:45:21,636 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:45:21,636 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:45:21,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:45:21,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:45:21,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:45:21,654 INFO L87 Difference]: Start difference. First operand 373 states and 539 transitions. cyclomatic complexity: 167 Second operand 3 states. [2018-11-18 09:45:22,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:45:22,154 INFO L93 Difference]: Finished difference Result 660 states and 918 transitions. [2018-11-18 09:45:22,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:45:22,156 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 660 states and 918 transitions. [2018-11-18 09:45:22,159 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-18 09:45:22,162 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 660 states to 660 states and 918 transitions. [2018-11-18 09:45:22,163 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 660 [2018-11-18 09:45:22,164 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 660 [2018-11-18 09:45:22,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 660 states and 918 transitions. [2018-11-18 09:45:22,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 09:45:22,166 INFO L705 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-11-18 09:45:22,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states and 918 transitions. [2018-11-18 09:45:22,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2018-11-18 09:45:22,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2018-11-18 09:45:22,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 918 transitions. [2018-11-18 09:45:22,183 INFO L728 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-11-18 09:45:22,183 INFO L608 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-11-18 09:45:22,183 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 09:45:22,184 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 660 states and 918 transitions. [2018-11-18 09:45:22,186 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-18 09:45:22,186 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:45:22,186 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:45:22,188 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 09:45:22,188 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:45:22,188 INFO L794 eck$LassoCheckResult]: Stem: 1793#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 1672#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 1673#L606-3 [2018-11-18 09:45:22,189 INFO L796 eck$LassoCheckResult]: Loop: 1673#L606-3 assume true; 2302#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 2300#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 1933#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 1934#L35 assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res := 22; 1685#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 2139#L606-3 assume true; 2137#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 2135#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 2133#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 2131#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 2129#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 2127#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 2125#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 2123#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 2121#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 2119#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 2117#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 2115#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 2113#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 2111#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 2109#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 2107#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 2052#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 2053#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 2293#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); 2290#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 2288#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); 2286#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 2050#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 2051#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 2066#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 2064#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 2062#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 2060#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 2061#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 2149#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 2054#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 2055#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 2153#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 2154#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 2157#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 2159#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 2161#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 2162#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 2192#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 2165#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 2166#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 2167#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 2169#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 2283#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); 2281#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 2279#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 2277#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)); 2276#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); 2275#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; 2270#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1673#L606-3 [2018-11-18 09:45:22,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:45:22,189 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-18 09:45:22,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:45:22,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:45:22,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:45:22,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:45:22,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:45:22,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:45:22,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:45:22,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:45:22,194 INFO L82 PathProgramCache]: Analyzing trace with hash 692590236, now seen corresponding path program 1 times [2018-11-18 09:45:22,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:45:22,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:45:22,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:45:22,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:45:22,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:45:22,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:45:22,247 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:45:22,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:45:22,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:45:22,248 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 09:45:22,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:45:22,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:45:22,248 INFO L87 Difference]: Start difference. First operand 660 states and 918 transitions. cyclomatic complexity: 259 Second operand 4 states. [2018-11-18 09:45:22,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:45:22,900 INFO L93 Difference]: Finished difference Result 1228 states and 1701 transitions. [2018-11-18 09:45:22,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:45:22,900 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1228 states and 1701 transitions. [2018-11-18 09:45:22,905 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1224 [2018-11-18 09:45:22,908 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1228 states to 1228 states and 1701 transitions. [2018-11-18 09:45:22,908 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1228 [2018-11-18 09:45:22,909 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1228 [2018-11-18 09:45:22,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1228 states and 1701 transitions. [2018-11-18 09:45:22,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 09:45:22,911 INFO L705 BuchiCegarLoop]: Abstraction has 1228 states and 1701 transitions. [2018-11-18 09:45:22,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states and 1701 transitions. [2018-11-18 09:45:22,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1225. [2018-11-18 09:45:22,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2018-11-18 09:45:22,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1695 transitions. [2018-11-18 09:45:22,934 INFO L728 BuchiCegarLoop]: Abstraction has 1225 states and 1695 transitions. [2018-11-18 09:45:22,935 INFO L608 BuchiCegarLoop]: Abstraction has 1225 states and 1695 transitions. [2018-11-18 09:45:22,935 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 09:45:22,935 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1225 states and 1695 transitions. [2018-11-18 09:45:22,940 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1221 [2018-11-18 09:45:22,940 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:45:22,940 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:45:22,941 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 09:45:22,941 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:45:22,942 INFO L794 eck$LassoCheckResult]: Stem: 3691#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 3567#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 3568#L606-3 [2018-11-18 09:45:22,942 INFO L796 eck$LassoCheckResult]: Loop: 3568#L606-3 assume true; 3817#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3671#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 3672#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); 3856#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 4625#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); 4740#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3830#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); 3831#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; 3752#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4527#L606-3 assume true; 4525#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4523#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 4521#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; 3712#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4668#L606-3 assume true; 4667#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4665#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 4663#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); 4661#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 4542#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); 4543#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 4755#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); 4547#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 3569#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)); 3570#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); 4425#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); 4422#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); 4418#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 4413#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); 4409#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 4405#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 4400#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 4395#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); 4390#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); 4385#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 4379#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); 4372#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 4367#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 4362#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); 4358#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 4354#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); 4350#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); 4345#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 4340#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 4335#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 4332#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 4331#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); 4330#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 4329#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 4328#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 4327#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); 4325#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 4323#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 4321#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); 4319#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 4317#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); 4315#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); 4314#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 4312#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); 4310#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 4308#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 4306#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)); 4304#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); 4302#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; 3716#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3568#L606-3 [2018-11-18 09:45:22,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:45:22,942 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-18 09:45:22,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:45:22,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:45:22,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:45:22,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:45:22,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:45:22,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:45:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:45:22,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:45:22,947 INFO L82 PathProgramCache]: Analyzing trace with hash 676565178, now seen corresponding path program 1 times [2018-11-18 09:45:22,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:45:22,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:45:22,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:45:22,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:45:22,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:45:22,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:45:23,027 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 09:45:23,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:45:23,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:45:23,027 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 09:45:23,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:45:23,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:45:23,028 INFO L87 Difference]: Start difference. First operand 1225 states and 1695 transitions. cyclomatic complexity: 472 Second operand 3 states. [2018-11-18 09:45:23,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:45:23,367 INFO L93 Difference]: Finished difference Result 1509 states and 2004 transitions. [2018-11-18 09:45:23,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:45:23,367 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1509 states and 2004 transitions. [2018-11-18 09:45:23,374 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1505 [2018-11-18 09:45:23,381 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1509 states to 1509 states and 2004 transitions. [2018-11-18 09:45:23,381 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1509 [2018-11-18 09:45:23,383 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1509 [2018-11-18 09:45:23,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1509 states and 2004 transitions. [2018-11-18 09:45:23,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 09:45:23,385 INFO L705 BuchiCegarLoop]: Abstraction has 1509 states and 2004 transitions. [2018-11-18 09:45:23,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states and 2004 transitions. [2018-11-18 09:45:23,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1508. [2018-11-18 09:45:23,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1508 states. [2018-11-18 09:45:23,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 2002 transitions. [2018-11-18 09:45:23,404 INFO L728 BuchiCegarLoop]: Abstraction has 1508 states and 2002 transitions. [2018-11-18 09:45:23,404 INFO L608 BuchiCegarLoop]: Abstraction has 1508 states and 2002 transitions. [2018-11-18 09:45:23,404 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 09:45:23,404 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1508 states and 2002 transitions. [2018-11-18 09:45:23,408 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-18 09:45:23,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:45:23,409 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:45:23,410 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 09:45:23,410 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:45:23,410 INFO L794 eck$LassoCheckResult]: Stem: 6431#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 6307#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 6308#L606-3 [2018-11-18 09:45:23,410 INFO L796 eck$LassoCheckResult]: Loop: 6308#L606-3 assume true; 7631#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7626#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 7621#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); 7616#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 7611#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); 7606#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 7601#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); 7549#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 7544#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)); 7541#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); 7537#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); 7533#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); 7529#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 7526#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); 7523#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 7520#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 7518#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 7250#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; 6542#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 7244#L606-3 assume true; 7242#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7240#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 7238#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; 6531#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 7245#L606-3 assume true; 7243#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7241#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 7239#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); 7237#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 7235#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); 7233#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 7231#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); 7229#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 7227#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)); 7225#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); 7223#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); 7221#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); 7219#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 7217#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); 7216#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 7214#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 7212#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 7210#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); 7208#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); 7206#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 7204#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); 7202#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 7200#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 7198#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); 7196#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 7194#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); 7192#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); 7190#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 7188#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 7186#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 7184#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 7182#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); 7180#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 7178#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 7176#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 7174#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); 7172#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 7170#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 7168#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); 7166#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 7164#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); 7162#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); 7160#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 7158#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); 7156#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 7154#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 7152#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)); 7150#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); 7148#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; 7147#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6308#L606-3 [2018-11-18 09:45:23,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:45:23,411 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-18 09:45:23,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:45:23,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:45:23,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:45:23,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:45:23,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:45:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:45:23,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:45:23,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:45:23,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1219893882, now seen corresponding path program 1 times [2018-11-18 09:45:23,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:45:23,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:45:23,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:45:23,418 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:45:23,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:45:23,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:45:23,445 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 09:45:23,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:45:23,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:45:23,446 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 09:45:23,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:45:23,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:45:23,446 INFO L87 Difference]: Start difference. First operand 1508 states and 2002 transitions. cyclomatic complexity: 496 Second operand 3 states. [2018-11-18 09:45:23,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:45:23,766 INFO L93 Difference]: Finished difference Result 1507 states and 1823 transitions. [2018-11-18 09:45:23,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:45:23,767 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1507 states and 1823 transitions. [2018-11-18 09:45:23,771 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-18 09:45:23,775 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1507 states to 1507 states and 1823 transitions. [2018-11-18 09:45:23,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1507 [2018-11-18 09:45:23,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1507 [2018-11-18 09:45:23,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1507 states and 1823 transitions. [2018-11-18 09:45:23,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 09:45:23,777 INFO L705 BuchiCegarLoop]: Abstraction has 1507 states and 1823 transitions. [2018-11-18 09:45:23,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states and 1823 transitions. [2018-11-18 09:45:23,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1507. [2018-11-18 09:45:23,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2018-11-18 09:45:23,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1823 transitions. [2018-11-18 09:45:23,790 INFO L728 BuchiCegarLoop]: Abstraction has 1507 states and 1823 transitions. [2018-11-18 09:45:23,790 INFO L608 BuchiCegarLoop]: Abstraction has 1507 states and 1823 transitions. [2018-11-18 09:45:23,790 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 09:45:23,790 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1507 states and 1823 transitions. [2018-11-18 09:45:23,794 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-18 09:45:23,794 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:45:23,794 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:45:23,795 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 09:45:23,795 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:45:23,796 INFO L794 eck$LassoCheckResult]: Stem: 9447#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 9328#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 9329#L606-3 [2018-11-18 09:45:23,796 INFO L796 eck$LassoCheckResult]: Loop: 9329#L606-3 assume true; 10113#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 10111#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 10109#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); 10107#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 10105#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); 10103#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 10101#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); 10099#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 10097#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)); 10095#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); 10093#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); 10090#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); 10088#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 10087#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); 10086#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 10085#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 10083#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 9896#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); 9897#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); 10137#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 10136#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); 10134#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 10132#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 10130#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); 10128#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10126#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); 10124#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); 10122#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 9774#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; 9665#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9767#L606-3 assume true; 9765#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 9763#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 9761#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); 9759#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 9757#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); 9755#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 9753#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); 9751#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 9749#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)); 9747#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); 9745#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); 9743#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); 9741#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 9739#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); 9737#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 9735#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 9733#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 9731#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); 9729#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); 9727#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 9725#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); 9723#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 9721#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 9719#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); 9717#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 9715#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); 9712#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); 9710#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 9708#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 9706#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 9704#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 9702#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); 9700#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 9698#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 9696#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 9694#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); 9692#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 9690#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 9688#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); 9686#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 9684#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); 9682#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); 9680#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 9678#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); 9676#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 9674#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 9672#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)); 9670#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); 9667#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; 9668#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9329#L606-3 [2018-11-18 09:45:23,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:45:23,796 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-18 09:45:23,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:45:23,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:45:23,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:45:23,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:45:23,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:45:23,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:45:23,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:45:23,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:45:23,803 INFO L82 PathProgramCache]: Analyzing trace with hash -606648447, now seen corresponding path program 1 times [2018-11-18 09:45:23,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:45:23,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:45:23,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:45:23,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:45:23,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:45:23,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:45:23,850 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:45:23,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:45:23,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:45:23,851 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 09:45:23,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:45:23,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:45:23,851 INFO L87 Difference]: Start difference. First operand 1507 states and 1823 transitions. cyclomatic complexity: 318 Second operand 3 states. [2018-11-18 09:45:24,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:45:24,045 INFO L93 Difference]: Finished difference Result 1496 states and 1779 transitions. [2018-11-18 09:45:24,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:45:24,046 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1496 states and 1779 transitions. [2018-11-18 09:45:24,050 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-18 09:45:24,053 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1496 states to 1496 states and 1779 transitions. [2018-11-18 09:45:24,053 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1496 [2018-11-18 09:45:24,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1496 [2018-11-18 09:45:24,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1496 states and 1779 transitions. [2018-11-18 09:45:24,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 09:45:24,056 INFO L705 BuchiCegarLoop]: Abstraction has 1496 states and 1779 transitions. [2018-11-18 09:45:24,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states and 1779 transitions. [2018-11-18 09:45:24,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1496. [2018-11-18 09:45:24,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2018-11-18 09:45:24,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 1779 transitions. [2018-11-18 09:45:24,067 INFO L728 BuchiCegarLoop]: Abstraction has 1496 states and 1779 transitions. [2018-11-18 09:45:24,067 INFO L608 BuchiCegarLoop]: Abstraction has 1496 states and 1779 transitions. [2018-11-18 09:45:24,067 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 09:45:24,067 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1496 states and 1779 transitions. [2018-11-18 09:45:24,071 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-18 09:45:24,072 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:45:24,072 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:45:24,072 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 09:45:24,072 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:45:24,073 INFO L794 eck$LassoCheckResult]: Stem: 12457#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 12337#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 12338#L606-3 [2018-11-18 09:45:24,073 INFO L796 eck$LassoCheckResult]: Loop: 12338#L606-3 assume true; 13073#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 13071#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 13069#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); 13063#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 13064#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); 13340#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 13338#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); 13336#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 13333#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)); 13332#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); 13331#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); 13330#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); 13329#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 13328#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); 13326#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 13324#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 13322#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 13320#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); 13318#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); 13316#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 13314#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); 13312#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 13310#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 13308#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); 13306#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13304#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); 13302#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); 13300#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 13298#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 13296#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 13294#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 13292#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); 13290#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 13288#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 13286#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 13284#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); 13282#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 13280#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 13278#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); 13276#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 13274#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); 13272#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); 13270#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 13268#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); 13266#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 13264#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 13262#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)); 13260#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); 13258#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); 13256#L259 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && (((9 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)); 13254#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); 13252#L276 assume !(7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 1 == ~a21~0 && 1 == ~a19~0 && 5 == calculate_output_~input && !(1 == ~a11~0)); 13250#L280 assume !(8 == ~a28~0 && 1 == ~a21~0 && (!(1 == ~a11~0) && (1 == calculate_output_~input && 8 == ~a17~0) && 1 == ~a19~0) && 1 == ~a25~0); 13248#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); 13246#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); 13244#L291 assume !(8 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a11~0) && 1 == ~a25~0 && 8 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a19~0); 13242#L293 assume !((1 == ~a19~0 && 8 == ~a17~0 && ((!(1 == ~a25~0) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a11~0)) && 11 == ~a28~0); 13240#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); 13238#L309 assume !((((((3 == calculate_output_~input && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)) && 11 == ~a28~0) && !(1 == ~a11~0)); 13236#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); 13234#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); 13232#L331 assume !((!(1 == ~a11~0) && (((4 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0) && 11 == ~a28~0) && 1 == ~a19~0); 13230#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)); 13228#L349 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && ((1 == ~a25~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 11 == ~a28~0) && 1 == ~a21~0); 13226#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); 13224#L361 assume !(1 == ~a19~0 && ((1 == ~a21~0 && (!(1 == ~a25~0) && 3 == calculate_output_~input) && 9 == ~a17~0) && 8 == ~a28~0) && 1 == ~a11~0); 13222#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)); 13220#L375 assume !(1 == ~a19~0 && (((8 == ~a17~0 && 5 == calculate_output_~input && !(1 == ~a11~0)) && 1 == ~a21~0) && 1 == ~a25~0) && 8 == ~a28~0); 13218#L378 assume !(((!(1 == ~a11~0) && ((1 == ~a21~0 && 4 == calculate_output_~input) && 10 == ~a28~0) && 8 == ~a17~0) && !(1 == ~a19~0)) && 1 == ~a25~0); 13216#L380 assume !(8 == ~a28~0 && (1 == ~a19~0 && 1 == ~a11~0 && !(1 == ~a25~0) && 9 == ~a17~0 && 6 == calculate_output_~input) && 1 == ~a21~0); 13214#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)); 13212#L394 assume !(((((!(1 == ~a25~0) && 1 == ~a19~0 && 3 == calculate_output_~input) && 9 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 13210#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)); 13208#L402 assume !(((!(1 == ~a11~0) && ((1 == ~a19~0 && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)); 13206#L404 assume !((1 == ~a11~0 && 1 == ~a19~0 && 1 == ~a21~0 && (9 == ~a17~0 && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 8 == ~a28~0); 13204#L407 assume !(!(1 == ~a11~0) && 1 == ~a21~0 && (1 == ~a19~0 && 8 == ~a17~0 && 1 == ~a25~0 && 5 == calculate_output_~input) && 11 == ~a28~0); 13202#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); 13200#L414 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13198#L414-2 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13196#L417-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13194#L420-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13192#L423-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13190#L426-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13188#L429-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13186#L432-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13184#L435-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12355#L438-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13181#L441-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13179#L444-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13177#L447-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13175#L450-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13173#L453-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13171#L456-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13169#L459-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13167#L462-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13165#L465-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13162#L468-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13160#L471-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13158#L474-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13156#L477-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13154#L480-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13152#L483-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13150#L486-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13148#L489-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13146#L492-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13144#L495-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13142#L498-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13140#L501-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13138#L504-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13136#L507-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13134#L510-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13132#L513-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13129#L516-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13127#L519-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13125#L522-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13123#L525-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13121#L528-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13119#L531-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13117#L534-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13115#L537-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13113#L540-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13111#L543-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13109#L546-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13107#L549-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13105#L552-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13104#L555-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13102#L558-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13100#L561-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13098#L564-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13096#L567-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13094#L570-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13092#L573-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13090#L576-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13088#L579-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13086#L582-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13084#L585-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13082#L588-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13080#L591-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13078#L594-1 calculate_output_#res := -2; 13076#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 12338#L606-3 [2018-11-18 09:45:24,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:45:24,074 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-18 09:45:24,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:45:24,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:45:24,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:45:24,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:45:24,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:45:24,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:45:24,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:45:24,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:45:24,078 INFO L82 PathProgramCache]: Analyzing trace with hash 245249823, now seen corresponding path program 1 times [2018-11-18 09:45:24,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:45:24,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:45:24,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:45:24,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:45:24,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:45:24,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:45:24,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:45:24,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:45:24,115 INFO L82 PathProgramCache]: Analyzing trace with hash -2003304803, now seen corresponding path program 1 times [2018-11-18 09:45:24,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:45:24,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:45:24,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:45:24,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:45:24,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:45:24,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:45:24,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:45:24,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:45:24,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 09:45:25,089 WARN L180 SmtUtils]: Spent 630.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2018-11-18 09:45:25,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 09:45:25,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-18 09:45:25,155 INFO L87 Difference]: Start difference. First operand 1496 states and 1779 transitions. cyclomatic complexity: 286 Second operand 10 states. [2018-11-18 09:45:25,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:45:25,910 INFO L93 Difference]: Finished difference Result 1688 states and 1968 transitions. [2018-11-18 09:45:25,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 09:45:25,915 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1688 states and 1968 transitions. [2018-11-18 09:45:25,922 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1632 [2018-11-18 09:45:25,929 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1688 states to 1688 states and 1968 transitions. [2018-11-18 09:45:25,929 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1688 [2018-11-18 09:45:25,930 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1688 [2018-11-18 09:45:25,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1688 states and 1968 transitions. [2018-11-18 09:45:25,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 09:45:25,933 INFO L705 BuchiCegarLoop]: Abstraction has 1688 states and 1968 transitions. [2018-11-18 09:45:25,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states and 1968 transitions. [2018-11-18 09:45:25,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1546. [2018-11-18 09:45:25,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2018-11-18 09:45:25,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 1826 transitions. [2018-11-18 09:45:25,955 INFO L728 BuchiCegarLoop]: Abstraction has 1546 states and 1826 transitions. [2018-11-18 09:45:25,955 INFO L608 BuchiCegarLoop]: Abstraction has 1546 states and 1826 transitions. [2018-11-18 09:45:25,955 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 09:45:25,955 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1546 states and 1826 transitions. [2018-11-18 09:45:25,961 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1490 [2018-11-18 09:45:25,961 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:45:25,961 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:45:25,961 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:45:25,962 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:45:25,962 INFO L794 eck$LassoCheckResult]: Stem: 15661#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 15546#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 15547#L606-3 assume true; 16760#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16758#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 16756#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); 16754#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; 15805#L597 [2018-11-18 09:45:25,962 INFO L796 eck$LassoCheckResult]: Loop: 15805#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 16282#L606-3 assume true; 16280#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16278#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 16276#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); 16274#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 16272#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); 16270#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 16268#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; 15805#L597 [2018-11-18 09:45:25,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:45:25,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1805984299, now seen corresponding path program 1 times [2018-11-18 09:45:25,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:45:25,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:45:25,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:45:25,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:45:25,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:45:25,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:45:25,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:45:25,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:45:25,972 INFO L82 PathProgramCache]: Analyzing trace with hash -278812021, now seen corresponding path program 1 times [2018-11-18 09:45:25,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:45:25,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:45:25,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:45:25,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:45:25,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:45:25,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:45:25,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:45:25,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:45:25,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1569761375, now seen corresponding path program 1 times [2018-11-18 09:45:25,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:45:25,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:45:25,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:45:25,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:45:25,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:45:25,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:45:25,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:45:26,170 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:45:26,170 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:45:26,170 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:45:26,170 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:45:26,170 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 09:45:26,170 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:45:26,170 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:45:26,170 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:45:26,170 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label23_true-unreach-call_false-termination.c_Iteration8_Lasso [2018-11-18 09:45:26,170 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:45:26,170 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:45:26,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:45:26,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:45:26,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:45:26,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:45:26,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:45:26,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:45:26,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:45:26,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:45:26,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:45:26,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:45:26,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:45:26,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:45:26,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:45:26,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:45:26,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:45:26,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:45:26,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:45:26,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:45:26,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:45:26,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:45:26,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:45:26,350 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:45:26,350 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c58413bc-4116-42b3-a54d-fad677d1f1be/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:45:26,353 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:45:26,354 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:45:26,355 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:45:26,356 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_c58413bc-4116-42b3-a54d-fad677d1f1be/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:45:26,371 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:45:26,371 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:45:26,373 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:45:26,373 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_c58413bc-4116-42b3-a54d-fad677d1f1be/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:45:26,390 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:45:26,390 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:45:26,392 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:45:26,392 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_c58413bc-4116-42b3-a54d-fad677d1f1be/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:45:26,408 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:45:26,408 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:45:26,410 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:45:26,410 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_c58413bc-4116-42b3-a54d-fad677d1f1be/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:45:26,426 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:45:26,426 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:45:26,428 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:45:26,428 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_c58413bc-4116-42b3-a54d-fad677d1f1be/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:45:26,443 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:45:26,443 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:45:26,445 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:45:26,445 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_c58413bc-4116-42b3-a54d-fad677d1f1be/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:45:26,460 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:45:26,460 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:45:26,462 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:45:26,462 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_c58413bc-4116-42b3-a54d-fad677d1f1be/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:45:26,477 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:45:26,478 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:45:26,479 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:45:26,479 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_c58413bc-4116-42b3-a54d-fad677d1f1be/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:45:26,495 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:45:26,496 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:45:26,498 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:45:26,498 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_c58413bc-4116-42b3-a54d-fad677d1f1be/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:45:26,513 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:45:26,514 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:45:26,515 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:45:26,515 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_c58413bc-4116-42b3-a54d-fad677d1f1be/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:45:26,531 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:45:26,532 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:45:26,534 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:45:26,534 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_c58413bc-4116-42b3-a54d-fad677d1f1be/bin-2019/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:45:26,549 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:45:26,550 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:45:26,551 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:45:26,551 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_c58413bc-4116-42b3-a54d-fad677d1f1be/bin-2019/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:45:26,566 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:45:26,567 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:45:26,569 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:45:26,569 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_c58413bc-4116-42b3-a54d-fad677d1f1be/bin-2019/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:45:26,585 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:45:26,585 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:45:26,587 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:45:26,587 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_c58413bc-4116-42b3-a54d-fad677d1f1be/bin-2019/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:45:26,602 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:45:26,602 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:45:26,605 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:45:26,605 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_c58413bc-4116-42b3-a54d-fad677d1f1be/bin-2019/uautomizer/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:45:26,620 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:45:26,620 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c58413bc-4116-42b3-a54d-fad677d1f1be/bin-2019/uautomizer/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:45:26,639 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 09:45:26,639 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:45:26,797 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:45:26,797 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_c58413bc-4116-42b3-a54d-fad677d1f1be/bin-2019/uautomizer/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:45:26,813 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:45:26,813 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:45:26,814 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:45:26,815 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_c58413bc-4116-42b3-a54d-fad677d1f1be/bin-2019/uautomizer/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:45:26,829 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:45:26,830 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c58413bc-4116-42b3-a54d-fad677d1f1be/bin-2019/uautomizer/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:45:26,847 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 09:45:26,847 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:45:26,982 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:45:26,982 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_c58413bc-4116-42b3-a54d-fad677d1f1be/bin-2019/uautomizer/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:45:26,998 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:45:26,998 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:45:27,003 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:45:27,003 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_c58413bc-4116-42b3-a54d-fad677d1f1be/bin-2019/uautomizer/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:45:27,018 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:45:27,018 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:45:27,021 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:45:27,021 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_c58413bc-4116-42b3-a54d-fad677d1f1be/bin-2019/uautomizer/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:45:27,036 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:45:27,036 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:45:27,038 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:45:27,038 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a28~0=0} Honda state: {~a28~0=10} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2018-11-18 09:45:27,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 09:45:27 BoogieIcfgContainer [2018-11-18 09:45:27,072 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 09:45:27,072 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 09:45:27,072 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 09:45:27,072 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 09:45:27,073 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:45:18" (3/4) ... [2018-11-18 09:45:27,075 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-18 09:45:27,106 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c58413bc-4116-42b3-a54d-fad677d1f1be/bin-2019/uautomizer/witness.graphml [2018-11-18 09:45:27,106 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 09:45:27,106 INFO L168 Benchmark]: Toolchain (without parser) took 10348.58 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 481.3 MB). Free memory was 955.4 MB in the beginning and 1.1 GB in the end (delta: -120.6 MB). Peak memory consumption was 360.7 MB. Max. memory is 11.5 GB. [2018-11-18 09:45:27,107 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:45:27,107 INFO L168 Benchmark]: CACSL2BoogieTranslator took 373.26 ms. Allocated memory is still 1.0 GB. Free memory was 955.4 MB in the beginning and 915.1 MB in the end (delta: 40.3 MB). Peak memory consumption was 40.3 MB. Max. memory is 11.5 GB. [2018-11-18 09:45:27,108 INFO L168 Benchmark]: Boogie Procedure Inliner took 101.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 915.1 MB in the beginning and 1.1 GB in the end (delta: -214.5 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2018-11-18 09:45:27,108 INFO L168 Benchmark]: Boogie Preprocessor took 41.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-18 09:45:27,108 INFO L168 Benchmark]: RCFGBuilder took 900.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 108.9 MB). Peak memory consumption was 108.9 MB. Max. memory is 11.5 GB. [2018-11-18 09:45:27,108 INFO L168 Benchmark]: BuchiAutomizer took 8895.46 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 341.3 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -58.6 MB). Peak memory consumption was 540.3 MB. Max. memory is 11.5 GB. [2018-11-18 09:45:27,109 INFO L168 Benchmark]: Witness Printer took 33.67 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-11-18 09:45:27,110 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 373.26 ms. Allocated memory is still 1.0 GB. Free memory was 955.4 MB in the beginning and 915.1 MB in the end (delta: 40.3 MB). Peak memory consumption was 40.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 101.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 915.1 MB in the beginning and 1.1 GB in the end (delta: -214.5 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 900.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 108.9 MB). Peak memory consumption was 108.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8895.46 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 341.3 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -58.6 MB). Peak memory consumption was 540.3 MB. Max. memory is 11.5 GB. * Witness Printer took 33.67 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 1546 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.8s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 5.1s. Construction of modules took 2.4s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 147 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 1546 states and ocurred in iteration 7. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1468 SDtfs, 3083 SDslu, 488 SDs, 0 SdLazy, 3702 SolverSat, 849 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time LassoAnalysisResults: nont1 unkn0 SFLI4 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital65 mio100 ax100 hnf103 lsp39 ukn90 mio100 lsp100 div100 bol100 ite100 ukn100 eq209 hnf93 smp100 dnf148 smp89 tf102 neg98 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 74ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 0 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 31 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - GeometricNonTerminationArgumentResult [Line: 614]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {a19=0, a17=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@632919b6=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@454f37b7=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@632919b6=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@454f37b7=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@632919b6=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@454f37b7=1 + sum_{k=0}^i 0, y=25 + sum_{k=0}^i 0, x=24 + sum_{k=0}^i 0, z=26 + sum_{k=0}^i 0, u=21 + sum_{k=0}^i 0, w=23 + sum_{k=0}^i 0, v=22 + sum_{k=0}^i 0, a=1 + sum_{k=0}^i 0, c=3 + sum_{k=0}^i 0, a28=10 + sum_{k=0}^i 0, \old(input)=6 + sum_{k=0}^i -6*0^k + 1*0^k, output=-1 + sum_{k=0}^i 22*0^k + -23*0^k + -23*k*0^(k-1) + 24*0^k, a25=0 + sum_{k=0}^i 0, a21=1 + sum_{k=0}^i 0, d=4 + sum_{k=0}^i 0, e=5 + sum_{k=0}^i 0, f=6 + sum_{k=0}^i 0, input=6 + sum_{k=0}^i 3*0^k + -8*0^k, input=6 + sum_{k=0}^i 2*0^k + -7*0^k} - StatisticsResult: NonterminationArgumentStatistics Unbounded Execution 5GEVs Lambdas: [0, 11, 0, 0, 0, 0] Mus: [0, 0, 0, 1, 0] - NonterminatingLassoResult [Line: 29]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND TRUE ((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1))) [L36] a28 = 10 [L37] return 22; Loop: [L614] RET, EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND TRUE ((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10)) [L48] a25 = 0 [L49] return -1; End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...