./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label57_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_365dddb1-665b-48fe-9023-27937ea9c5e7/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_365dddb1-665b-48fe-9023-27937ea9c5e7/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_365dddb1-665b-48fe-9023-27937ea9c5e7/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_365dddb1-665b-48fe-9023-27937ea9c5e7/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label57_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_365dddb1-665b-48fe-9023-27937ea9c5e7/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_365dddb1-665b-48fe-9023-27937ea9c5e7/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7289a24916410dada55d7befe9c59871f03a3aa1 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 23:47:54,736 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 23:47:54,738 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 23:47:54,747 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 23:47:54,748 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 23:47:54,749 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 23:47:54,750 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 23:47:54,751 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 23:47:54,753 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 23:47:54,753 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 23:47:54,754 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 23:47:54,755 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 23:47:54,755 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 23:47:54,756 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 23:47:54,757 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 23:47:54,758 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 23:47:54,759 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 23:47:54,760 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 23:47:54,762 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 23:47:54,763 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 23:47:54,764 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 23:47:54,765 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 23:47:54,768 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 23:47:54,768 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 23:47:54,768 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 23:47:54,769 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 23:47:54,770 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 23:47:54,771 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 23:47:54,772 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 23:47:54,773 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 23:47:54,773 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 23:47:54,774 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 23:47:54,774 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 23:47:54,774 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 23:47:54,775 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 23:47:54,775 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 23:47:54,776 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_365dddb1-665b-48fe-9023-27937ea9c5e7/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-22 23:47:54,790 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 23:47:54,790 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 23:47:54,791 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 23:47:54,791 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 23:47:54,791 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 23:47:54,791 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-22 23:47:54,791 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-22 23:47:54,792 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-22 23:47:54,792 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-22 23:47:54,792 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-22 23:47:54,792 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-22 23:47:54,792 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 23:47:54,792 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 23:47:54,793 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-22 23:47:54,793 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 23:47:54,793 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 23:47:54,793 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 23:47:54,793 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-22 23:47:54,793 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-22 23:47:54,793 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-22 23:47:54,793 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 23:47:54,794 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 23:47:54,794 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-22 23:47:54,794 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 23:47:54,794 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-22 23:47:54,794 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 23:47:54,794 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 23:47:54,794 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-22 23:47:54,795 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 23:47:54,795 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 23:47:54,795 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-22 23:47:54,796 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-22 23:47:54,796 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_365dddb1-665b-48fe-9023-27937ea9c5e7/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7289a24916410dada55d7befe9c59871f03a3aa1 [2018-11-22 23:47:54,826 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 23:47:54,836 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 23:47:54,839 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 23:47:54,840 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 23:47:54,840 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 23:47:54,841 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_365dddb1-665b-48fe-9023-27937ea9c5e7/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label57_true-unreach-call_false-termination.c [2018-11-22 23:47:54,885 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_365dddb1-665b-48fe-9023-27937ea9c5e7/bin-2019/uautomizer/data/14cd184aa/b9176719b7104246ab0086653e83d5e0/FLAGe5cc3c50f [2018-11-22 23:47:55,303 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 23:47:55,304 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_365dddb1-665b-48fe-9023-27937ea9c5e7/sv-benchmarks/c/eca-rers2012/Problem02_label57_true-unreach-call_false-termination.c [2018-11-22 23:47:55,315 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_365dddb1-665b-48fe-9023-27937ea9c5e7/bin-2019/uautomizer/data/14cd184aa/b9176719b7104246ab0086653e83d5e0/FLAGe5cc3c50f [2018-11-22 23:47:55,330 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_365dddb1-665b-48fe-9023-27937ea9c5e7/bin-2019/uautomizer/data/14cd184aa/b9176719b7104246ab0086653e83d5e0 [2018-11-22 23:47:55,332 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 23:47:55,333 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 23:47:55,334 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 23:47:55,334 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 23:47:55,337 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 23:47:55,337 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:47:55" (1/1) ... [2018-11-22 23:47:55,340 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e234a26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:47:55, skipping insertion in model container [2018-11-22 23:47:55,340 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:47:55" (1/1) ... [2018-11-22 23:47:55,347 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 23:47:55,388 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 23:47:55,675 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:47:55,678 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 23:47:55,753 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:47:55,769 INFO L195 MainTranslator]: Completed translation [2018-11-22 23:47:55,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:47:55 WrapperNode [2018-11-22 23:47:55,769 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 23:47:55,771 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 23:47:55,771 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 23:47:55,771 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 23:47:55,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:47:55" (1/1) ... [2018-11-22 23:47:55,857 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:47:55" (1/1) ... [2018-11-22 23:47:55,903 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 23:47:55,903 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 23:47:55,904 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 23:47:55,904 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 23:47:55,911 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:47:55" (1/1) ... [2018-11-22 23:47:55,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:47:55" (1/1) ... [2018-11-22 23:47:55,915 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:47:55" (1/1) ... [2018-11-22 23:47:55,915 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:47:55" (1/1) ... [2018-11-22 23:47:55,933 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:47:55" (1/1) ... [2018-11-22 23:47:55,944 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:47:55" (1/1) ... [2018-11-22 23:47:55,948 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:47:55" (1/1) ... [2018-11-22 23:47:55,953 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 23:47:55,953 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 23:47:55,953 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 23:47:55,953 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 23:47:55,955 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:47:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_365dddb1-665b-48fe-9023-27937ea9c5e7/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-22 23:47:56,008 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-22 23:47:56,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 23:47:56,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 23:47:57,132 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 23:47:57,132 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-22 23:47:57,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:47:57 BoogieIcfgContainer [2018-11-22 23:47:57,133 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 23:47:57,133 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-22 23:47:57,133 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-22 23:47:57,136 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-22 23:47:57,136 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 23:47:57,137 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.11 11:47:55" (1/3) ... [2018-11-22 23:47:57,138 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@17a9c79f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 11:47:57, skipping insertion in model container [2018-11-22 23:47:57,138 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 23:47:57,138 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:47:55" (2/3) ... [2018-11-22 23:47:57,138 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@17a9c79f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 11:47:57, skipping insertion in model container [2018-11-22 23:47:57,138 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 23:47:57,139 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:47:57" (3/3) ... [2018-11-22 23:47:57,140 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label57_true-unreach-call_false-termination.c [2018-11-22 23:47:57,181 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 23:47:57,181 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-22 23:47:57,181 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-22 23:47:57,181 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-22 23:47:57,182 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 23:47:57,182 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 23:47:57,182 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-22 23:47:57,182 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 23:47:57,182 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-22 23:47:57,198 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2018-11-22 23:47:57,225 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2018-11-22 23:47:57,226 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:47:57,226 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:47:57,233 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-22 23:47:57,233 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-22 23:47:57,233 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-22 23:47:57,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2018-11-22 23:47:57,240 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2018-11-22 23:47:57,240 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:47:57,240 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:47:57,241 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-22 23:47:57,242 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-22 23:47:57,247 INFO L794 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRYtrue ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 9#L-1true havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 164#L606-2true [2018-11-22 23:47:57,248 INFO L796 eck$LassoCheckResult]: Loop: 164#L606-2true assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 65#L611true assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 191#L30true assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 206#L597true main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 164#L606-2true [2018-11-22 23:47:57,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:47:57,252 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-22 23:47:57,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:47:57,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:47:57,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:47:57,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:47:57,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:47:57,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:47:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:47:57,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:47:57,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1268139, now seen corresponding path program 1 times [2018-11-22 23:47:57,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:47:57,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:47:57,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:47:57,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:47:57,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:47:57,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:47:57,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:47:57,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:47:57,360 INFO L82 PathProgramCache]: Analyzing trace with hash 889695341, now seen corresponding path program 1 times [2018-11-22 23:47:57,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:47:57,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:47:57,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:47:57,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:47:57,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:47:57,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:47:57,453 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-22 23:47:57,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:47:57,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 23:47:57,572 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 23:47:57,573 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 23:47:57,573 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 23:47:57,573 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 23:47:57,573 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-22 23:47:57,573 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 23:47:57,574 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 23:47:57,574 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 23:47:57,574 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label57_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-22 23:47:57,574 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 23:47:57,574 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 23:47:57,594 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-22 23:47:57,600 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-22 23:47:57,626 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-22 23:47:57,629 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-22 23:47:57,635 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-22 23:47:57,638 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-22 23:47:57,640 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-22 23:47:57,652 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-22 23:47:57,859 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 23:47:57,860 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_365dddb1-665b-48fe-9023-27937ea9c5e7/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-22 23:47:57,864 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 23:47:57,865 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 23:47:57,873 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 23:47:57,873 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_365dddb1-665b-48fe-9023-27937ea9c5e7/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-22 23:47:57,897 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 23:47:57,897 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 23:47:57,906 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 23:47:57,907 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_365dddb1-665b-48fe-9023-27937ea9c5e7/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-22 23:47:57,943 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 23:47:57,943 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 23:47:57,946 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 23:47:57,946 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_365dddb1-665b-48fe-9023-27937ea9c5e7/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-22 23:47:57,979 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 23:47:57,979 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 23:47:57,991 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 23:47:57,991 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_365dddb1-665b-48fe-9023-27937ea9c5e7/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 23:47:58,011 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 23:47:58,011 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 23:47:58,015 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 23:47:58,015 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_365dddb1-665b-48fe-9023-27937ea9c5e7/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 23:47:58,041 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 23:47:58,041 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 23:47:58,059 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 23:47:58,059 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_365dddb1-665b-48fe-9023-27937ea9c5e7/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 23:47:58,078 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 23:47:58,078 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 23:47:58,084 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 23:47:58,084 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_365dddb1-665b-48fe-9023-27937ea9c5e7/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-22 23:47:58,118 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 23:47:58,119 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_365dddb1-665b-48fe-9023-27937ea9c5e7/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-22 23:47:58,151 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-22 23:47:58,152 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 23:47:58,186 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-22 23:47:58,187 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 23:47:58,188 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 23:47:58,188 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 23:47:58,188 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 23:47:58,188 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 23:47:58,188 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 23:47:58,188 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 23:47:58,188 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 23:47:58,188 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label57_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-22 23:47:58,189 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 23:47:58,189 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 23:47:58,191 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-22 23:47:58,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-22 23:47:58,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-22 23:47:58,240 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-22 23:47:58,245 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-22 23:47:58,248 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-22 23:47:58,254 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-22 23:47:58,257 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-22 23:47:58,496 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 23:47:58,503 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 23:47:58,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-22 23:47:58,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:47:58,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:58,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:58,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:58,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:47:58,512 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:47:58,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:58,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:58,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:58,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:47:58,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:58,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:58,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:58,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:47:58,525 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:47:58,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:58,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:58,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:58,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:47:58,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:58,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:58,530 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-22 23:47:58,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:47:58,532 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:47:58,532 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:58,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:58,556 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:58,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:47:58,556 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:58,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:58,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:58,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:47:58,557 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:47:58,557 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:58,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:58,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-22 23:47:58,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:47:58,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:58,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:58,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:58,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:47:58,565 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:47:58,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:58,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:58,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:58,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:47:58,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:58,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:58,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:58,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:47:58,570 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:47:58,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:58,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:58,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:58,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:47:58,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:58,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:58,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:58,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:47:58,574 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:47:58,575 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:58,575 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:58,576 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:58,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:47:58,577 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:58,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:58,577 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:47:58,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:47:58,578 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:47:58,578 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:58,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:58,582 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-22 23:47:58,583 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:58,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:47:58,584 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:58,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:58,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:58,584 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:47:58,585 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:47:58,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:58,593 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:58,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:58,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:47:58,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:58,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:58,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:58,594 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:47:58,595 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:47:58,595 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:58,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:58,598 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:58,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:47:58,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:58,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:58,599 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-22 23:47:58,599 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:47:58,601 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-22 23:47:58,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:58,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:58,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-22 23:47:58,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:47:58,619 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:58,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:58,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:58,619 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:47:58,620 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:47:58,620 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:58,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:58,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:58,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:47:58,625 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:58,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:58,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:58,625 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:47:58,626 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:47:58,626 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:58,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:58,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-22 23:47:58,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:47:58,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:58,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:58,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:58,630 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:47:58,631 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:47:58,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:58,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:58,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:58,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:47:58,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:58,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:58,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:58,634 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:47:58,635 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:47:58,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:58,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:58,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:58,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:47:58,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:58,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:58,637 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:47:58,637 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:47:58,638 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:47:58,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:58,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:58,643 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-22 23:47:58,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:58,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:47:58,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:58,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:58,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:58,645 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:47:58,646 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:47:58,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:58,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:58,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:58,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:47:58,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:58,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:58,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:58,655 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:47:58,656 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:47:58,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:58,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:58,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:58,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:47:58,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:58,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:58,661 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-22 23:47:58,661 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:47:58,667 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-22 23:47:58,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:58,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:58,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:58,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:47:58,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:58,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:58,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:58,685 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:47:58,686 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:47:58,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:58,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:58,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:58,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:47:58,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:58,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:58,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:58,691 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:47:58,692 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:47:58,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:58,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:58,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-22 23:47:58,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:47:58,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:58,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:58,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:58,695 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:47:58,696 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:47:58,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:58,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:58,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:58,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:47:58,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:58,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:58,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:58,699 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:47:58,700 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:47:58,700 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:58,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:58,701 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:58,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:47:58,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:58,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:58,702 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:47:58,702 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:47:58,703 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 23:47:58,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:58,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:58,707 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-22 23:47:58,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-22 23:47:58,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:47:58,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:58,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:58,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:58,709 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:47:58,710 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:47:58,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:58,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:58,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:58,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:47:58,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:58,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:58,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:58,718 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:47:58,719 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:47:58,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:58,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:58,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:58,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:47:58,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:58,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:58,723 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-22 23:47:58,723 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:47:58,725 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-22 23:47:58,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:58,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:58,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:58,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:47:58,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:58,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:58,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:58,739 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:47:58,740 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:47:58,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:58,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:58,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:58,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:47:58,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:58,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:58,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:58,745 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:47:58,745 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:47:58,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:58,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:58,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:58,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:47:58,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:58,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:58,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:58,748 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:47:58,749 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:47:58,749 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:58,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:58,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:58,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:47:58,752 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:58,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:58,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:58,753 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:47:58,753 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:47:58,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:58,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:58,754 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:58,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:47:58,755 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:58,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:58,755 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:47:58,755 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:47:58,756 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-22 23:47:58,756 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:58,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:58,761 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-22 23:47:58,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:58,762 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:47:58,762 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:47:58,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:58,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:58,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:58,762 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:47:58,764 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:47:58,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:58,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:58,777 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:58,777 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:47:58,777 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:47:58,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:58,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:58,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:58,778 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:47:58,778 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:47:58,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:58,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:58,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:58,782 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:47:58,782 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:47:58,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:58,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:58,782 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-22 23:47:58,783 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:47:58,785 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-22 23:47:58,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:58,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:58,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:58,815 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:47:58,815 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:47:58,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:58,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:58,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:58,816 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:47:58,817 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:47:58,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:58,821 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:58,821 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:58,822 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:47:58,822 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:47:58,822 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:58,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:58,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:58,822 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:47:58,823 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:47:58,823 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:58,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:58,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:58,826 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:47:58,826 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:47:58,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:58,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:58,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:58,827 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:47:58,827 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:47:58,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:58,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:58,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:58,831 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:47:58,831 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:47:58,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:58,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:58,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:58,832 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:47:58,832 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:47:58,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:58,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:58,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:58,834 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:47:58,834 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:47:58,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:58,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:58,834 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:47:58,834 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:47:58,835 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:47:58,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:58,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:58,844 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-22 23:47:58,845 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:58,845 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:47:58,845 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-22 23:47:58,845 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:58,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:58,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:58,846 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:47:58,848 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:47:58,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:58,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:58,863 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:58,863 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:47:58,863 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-22 23:47:58,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:58,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:58,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:58,864 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:47:58,865 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:47:58,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:58,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:58,869 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:58,869 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:47:58,870 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-22 23:47:58,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:58,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:58,870 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-22 23:47:58,870 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:47:58,874 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-22 23:47:58,874 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:58,902 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:58,903 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:58,904 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:47:58,904 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-22 23:47:58,904 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:58,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:58,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:58,904 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:47:58,905 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:47:58,906 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:58,911 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:58,912 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:58,912 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:47:58,912 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-22 23:47:58,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:58,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:58,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:58,913 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:47:58,914 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:47:58,914 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:58,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:58,917 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:58,918 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:47:58,918 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-22 23:47:58,918 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:58,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:58,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:58,918 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:47:58,919 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:47:58,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:58,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:58,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-22 23:47:58,923 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:47:58,923 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-22 23:47:58,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:58,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:58,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:58,923 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:47:58,924 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:47:58,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:58,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:58,926 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:58,926 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:47:58,926 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-22 23:47:58,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:58,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:58,927 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:47:58,927 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:47:58,928 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 23:47:58,928 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:58,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:58,938 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-22 23:47:58,938 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:58,939 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:47:58,939 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:47:58,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:58,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:58,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:58,939 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:47:58,942 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:47:58,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:58,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:58,951 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:58,951 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:47:58,952 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:47:58,952 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:58,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:58,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:58,952 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:47:58,953 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:47:58,953 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:58,958 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:58,958 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:58,959 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:47:58,959 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:47:58,959 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:58,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:58,959 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-22 23:47:58,959 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:47:58,964 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-22 23:47:58,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:58,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:58,997 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:58,997 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:47:58,998 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:47:58,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:58,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:58,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:58,998 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:47:59,000 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:47:59,000 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:59,005 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:59,005 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:59,006 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:47:59,006 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:47:59,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:59,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:59,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:59,007 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:47:59,008 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:47:59,008 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:59,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:59,012 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:59,012 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:47:59,013 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:47:59,013 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:59,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:59,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:59,013 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:47:59,014 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:47:59,014 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:59,018 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:59,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:59,019 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:47:59,019 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:47:59,019 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:59,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:59,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:59,020 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:47:59,021 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:47:59,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:59,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:59,022 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:59,022 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:47:59,023 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:47:59,023 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:59,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:59,023 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:47:59,023 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:47:59,025 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-22 23:47:59,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:59,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:59,035 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-22 23:47:59,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:59,035 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:47:59,036 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:47:59,036 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:59,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:59,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:59,036 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:47:59,037 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:47:59,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:59,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:59,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:59,047 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:47:59,047 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:47:59,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:59,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:59,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:59,047 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:47:59,048 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:47:59,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:59,050 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:59,050 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:59,051 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:47:59,051 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:47:59,051 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:59,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:59,051 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-22 23:47:59,051 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:47:59,053 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-22 23:47:59,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:59,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:59,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:59,070 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:47:59,071 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:47:59,071 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:59,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:59,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:59,071 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:47:59,072 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:47:59,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:59,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:59,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:59,077 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:47:59,077 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:47:59,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:59,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:59,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:59,077 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:47:59,078 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:47:59,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:59,080 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:59,080 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:59,081 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:47:59,081 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:47:59,081 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:59,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:59,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:59,081 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:47:59,081 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:47:59,082 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:59,084 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:59,084 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:59,085 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:47:59,085 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:47:59,085 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:59,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:59,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:59,085 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:47:59,086 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:47:59,086 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:59,087 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:59,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:59,088 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:47:59,088 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:47:59,088 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:59,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:59,089 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:47:59,089 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:47:59,090 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 23:47:59,090 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:59,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:59,097 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-22 23:47:59,097 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:59,098 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:47:59,098 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:47:59,098 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:59,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:59,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:59,098 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-22 23:47:59,100 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:47:59,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:59,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:59,136 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:59,136 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:47:59,136 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:47:59,137 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:59,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:59,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:59,137 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-22 23:47:59,137 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:47:59,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:59,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:59,141 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:59,141 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:47:59,142 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:47:59,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:59,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:59,142 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-22 23:47:59,142 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-22 23:47:59,145 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-22 23:47:59,145 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:59,230 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:59,230 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:59,231 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:47:59,231 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:47:59,231 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:59,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:59,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:59,232 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-22 23:47:59,233 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:47:59,233 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:59,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:59,243 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:59,244 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:47:59,244 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:47:59,244 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:59,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:59,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:59,244 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-22 23:47:59,245 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:47:59,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:59,248 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:59,248 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:59,248 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:47:59,249 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:47:59,249 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:59,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:59,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:59,249 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-22 23:47:59,250 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:47:59,250 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:59,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:59,253 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:59,254 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:47:59,254 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:47:59,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:59,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:59,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:47:59,254 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-22 23:47:59,255 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:47:59,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:59,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:59,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:47:59,259 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:47:59,259 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:47:59,259 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:47:59,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:47:59,260 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:47:59,260 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-22 23:47:59,261 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-22 23:47:59,261 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:47:59,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:47:59,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:47:59,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:47:59,291 INFO L87 Difference]: Start difference. First operand 226 states. Second operand 3 states. [2018-11-22 23:48:00,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:48:00,073 INFO L93 Difference]: Finished difference Result 379 states and 546 transitions. [2018-11-22 23:48:00,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:48:00,075 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 379 states and 546 transitions. [2018-11-22 23:48:00,081 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 370 [2018-11-22 23:48:00,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 379 states to 372 states and 539 transitions. [2018-11-22 23:48:00,088 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 372 [2018-11-22 23:48:00,089 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 372 [2018-11-22 23:48:00,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 372 states and 539 transitions. [2018-11-22 23:48:00,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:48:00,092 INFO L705 BuchiCegarLoop]: Abstraction has 372 states and 539 transitions. [2018-11-22 23:48:00,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states and 539 transitions. [2018-11-22 23:48:00,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 371. [2018-11-22 23:48:00,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-11-22 23:48:00,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 537 transitions. [2018-11-22 23:48:00,127 INFO L728 BuchiCegarLoop]: Abstraction has 371 states and 537 transitions. [2018-11-22 23:48:00,127 INFO L608 BuchiCegarLoop]: Abstraction has 371 states and 537 transitions. [2018-11-22 23:48:00,127 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-22 23:48:00,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 371 states and 537 transitions. [2018-11-22 23:48:00,129 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 369 [2018-11-22 23:48:00,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:48:00,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:48:00,130 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-22 23:48:00,130 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:48:00,130 INFO L794 eck$LassoCheckResult]: Stem: 747#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 628#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 629#L606-2 [2018-11-22 23:48:00,130 INFO L796 eck$LassoCheckResult]: Loop: 629#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 729#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 730#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); 867#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 756#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); 691#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 692#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); 840#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 630#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; 631#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 629#L606-2 [2018-11-22 23:48:00,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:48:00,130 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-22 23:48:00,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:48:00,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:48:00,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:48:00,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:48:00,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:48:00,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:48:00,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:48:00,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:48:00,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1948456188, now seen corresponding path program 1 times [2018-11-22 23:48:00,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:48:00,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:48:00,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:48:00,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:48:00,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:48:00,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:48:00,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:48:00,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:48:00,149 INFO L82 PathProgramCache]: Analyzing trace with hash -141898178, now seen corresponding path program 1 times [2018-11-22 23:48:00,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:48:00,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:48:00,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:48:00,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:48:00,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:48:00,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:48:00,166 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-22 23:48:00,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:48:00,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 23:48:00,268 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 23:48:00,269 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 23:48:00,269 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 23:48:00,269 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 23:48:00,269 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-22 23:48:00,269 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 23:48:00,269 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 23:48:00,269 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 23:48:00,269 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label57_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-22 23:48:00,269 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 23:48:00,269 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 23:48:00,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:48:00,274 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-22 23:48:00,278 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-22 23:48:00,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:48:00,282 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-22 23:48:00,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:48:00,289 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-22 23:48:00,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:48:00,409 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 23:48:00,409 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_365dddb1-665b-48fe-9023-27937ea9c5e7/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-22 23:48:00,415 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 23:48:00,416 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 23:48:00,431 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 23:48:00,431 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_365dddb1-665b-48fe-9023-27937ea9c5e7/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-22 23:48:00,452 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 23:48:00,452 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 23:48:00,458 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 23:48:00,458 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_365dddb1-665b-48fe-9023-27937ea9c5e7/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-22 23:48:00,484 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 23:48:00,484 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 23:48:00,486 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 23:48:00,487 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_365dddb1-665b-48fe-9023-27937ea9c5e7/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-22 23:48:00,508 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 23:48:00,508 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 23:48:00,514 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 23:48:00,514 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_365dddb1-665b-48fe-9023-27937ea9c5e7/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-22 23:48:00,539 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 23:48:00,539 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 23:48:00,542 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 23:48:00,542 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_365dddb1-665b-48fe-9023-27937ea9c5e7/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-22 23:48:00,567 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 23:48:00,567 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_365dddb1-665b-48fe-9023-27937ea9c5e7/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-22 23:48:00,599 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-22 23:48:00,599 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 23:48:00,638 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-22 23:48:00,641 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 23:48:00,641 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 23:48:00,641 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 23:48:00,641 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 23:48:00,641 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 23:48:00,641 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 23:48:00,641 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 23:48:00,641 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 23:48:00,641 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label57_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-22 23:48:00,641 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 23:48:00,642 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 23:48:00,643 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-22 23:48:00,647 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-22 23:48:00,653 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-22 23:48:00,655 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-22 23:48:00,657 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-22 23:48:00,659 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-22 23:48:00,663 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-22 23:48:00,673 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-22 23:48:00,776 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 23:48:00,776 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 23:48:00,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:00,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:48:00,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:00,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:00,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:48:00,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:48:00,778 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:48:00,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:00,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:00,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:00,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:48:00,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:00,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:00,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:48:00,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:48:00,780 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:48:00,780 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:00,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:00,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:00,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:48:00,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:00,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:00,786 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:48:00,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:48:00,787 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:48:00,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:00,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:00,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:00,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:48:00,788 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:00,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:00,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:48:00,789 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:48:00,789 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:48:00,789 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:00,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:00,790 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:00,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:48:00,790 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:00,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:00,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:48:00,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:48:00,791 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:48:00,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:00,791 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:00,792 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:00,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:48:00,792 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:00,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:00,792 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:48:00,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:48:00,793 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:48:00,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:00,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:00,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-22 23:48:00,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:48:00,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:00,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:00,796 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:48:00,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:48:00,796 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:48:00,797 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:00,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:00,799 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:00,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:48:00,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:00,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:00,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:48:00,800 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:48:00,800 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:48:00,800 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:00,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:00,802 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-22 23:48:00,803 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:00,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:48:00,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:00,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:00,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:48:00,803 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:48:00,804 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:48:00,804 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:00,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:00,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:00,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:48:00,806 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:00,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:00,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:48:00,808 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:48:00,808 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:48:00,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:00,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:00,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:00,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:48:00,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:00,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:00,812 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:48:00,812 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:48:00,812 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:48:00,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:00,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:00,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:00,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:48:00,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:00,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:00,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:48:00,814 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:48:00,814 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:48:00,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:00,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:00,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:00,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:48:00,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:00,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:00,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:48:00,816 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:48:00,816 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:48:00,816 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:00,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:00,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:00,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:48:00,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:00,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:00,818 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:48:00,819 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:48:00,819 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:48:00,820 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:00,821 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:00,822 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:00,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:48:00,822 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:00,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:00,822 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:48:00,823 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:48:00,823 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:48:00,823 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:00,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:00,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:00,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:48:00,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:00,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:00,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:48:00,828 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:48:00,829 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:48:00,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:00,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:00,831 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-22 23:48:00,832 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:00,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:48:00,832 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:00,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:00,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:48:00,832 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:48:00,833 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:48:00,833 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:00,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:00,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:00,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:48:00,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:00,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:00,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:48:00,835 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:48:00,836 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:48:00,836 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:00,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:00,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:00,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:48:00,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:00,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:00,839 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:48:00,839 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:48:00,840 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 23:48:00,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:00,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:00,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:00,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:48:00,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:00,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:00,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:48:00,841 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:48:00,842 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:48:00,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:00,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:00,842 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:00,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:48:00,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:00,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:00,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:48:00,843 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:48:00,843 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:48:00,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:00,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:00,845 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:00,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:48:00,845 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:00,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:00,846 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:48:00,846 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:48:00,847 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 23:48:00,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:00,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:00,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:00,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:48:00,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:00,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:00,851 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:48:00,851 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:48:00,852 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 23:48:00,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:00,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:00,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-22 23:48:00,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:48:00,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:00,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:00,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:48:00,863 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:48:00,864 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:48:00,864 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:00,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:00,868 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-22 23:48:00,869 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:00,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:48:00,869 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:00,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:00,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:48:00,869 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:48:00,870 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:48:00,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:00,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:00,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:00,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:48:00,872 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:00,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:00,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:48:00,872 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:48:00,873 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:48:00,873 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:00,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:00,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:00,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:48:00,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:00,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:00,885 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:48:00,885 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:48:00,886 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-22 23:48:00,886 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:00,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:00,887 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:00,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:48:00,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:00,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:00,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:48:00,888 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:48:00,888 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:48:00,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:00,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:00,889 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:00,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:48:00,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:00,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:00,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:48:00,892 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:48:00,892 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:48:00,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:00,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:00,894 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:00,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:48:00,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:00,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:00,895 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:48:00,895 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:48:00,896 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-22 23:48:00,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:00,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:00,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:00,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:48:00,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:00,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:00,900 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:48:00,900 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:48:00,901 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-22 23:48:00,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:00,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:00,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:00,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:48:00,915 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:00,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:00,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:48:00,915 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:48:00,916 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:48:00,916 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:00,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:00,921 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-22 23:48:00,921 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:00,921 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:48:00,921 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:48:00,921 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:00,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:00,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:48:00,923 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:48:00,923 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:48:00,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:00,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:00,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-22 23:48:00,926 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:48:00,927 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:48:00,927 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:00,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:00,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:48:00,928 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:48:00,928 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:48:00,928 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:00,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:00,932 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:00,932 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:48:00,932 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:48:00,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:00,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:00,932 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:48:00,932 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:48:00,933 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:48:00,933 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:00,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:00,935 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:00,935 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:48:00,935 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:48:00,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:00,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:00,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:48:00,936 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:48:00,936 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:48:00,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:00,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:00,937 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:00,937 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:48:00,938 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:48:00,938 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:00,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:00,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:48:00,939 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:48:00,939 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:48:00,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:00,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:00,941 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:00,941 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:48:00,942 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:48:00,942 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:00,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:00,942 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:48:00,942 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:48:00,943 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:48:00,943 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:00,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:00,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:00,947 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:48:00,947 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:48:00,947 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:00,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:00,948 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:48:00,948 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:48:00,949 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:48:00,949 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:00,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:00,956 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:00,956 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:48:00,956 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:48:00,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:00,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:00,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:48:00,957 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-22 23:48:00,957 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-22 23:48:00,957 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:00,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:00,961 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-22 23:48:00,961 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:00,962 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:48:00,962 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-22 23:48:00,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:00,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:00,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:48:00,963 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:48:00,963 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:48:00,963 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:00,966 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:00,966 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:00,966 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:48:00,967 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-22 23:48:00,967 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:00,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:00,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:48:00,967 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:48:00,968 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:48:00,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:00,972 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:00,972 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:00,973 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:48:00,973 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-22 23:48:00,973 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:00,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:00,973 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:48:00,973 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:48:00,974 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 23:48:00,974 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:00,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:00,975 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:00,976 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:48:00,976 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-22 23:48:00,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:00,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:00,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:48:00,976 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:48:00,977 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:48:00,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:00,978 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:00,978 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:00,979 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:48:00,979 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-22 23:48:00,979 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:00,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:00,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:48:00,979 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:48:00,980 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:48:00,980 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:00,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:00,983 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:00,983 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:48:00,983 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-22 23:48:00,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:00,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:00,983 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:48:00,984 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:48:00,985 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 23:48:00,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:00,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:00,991 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:00,992 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:48:00,992 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-22 23:48:00,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:00,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:00,992 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:48:00,992 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:48:00,995 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 23:48:00,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:01,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:01,011 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:01,011 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:48:01,012 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-22 23:48:01,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:01,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:01,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:48:01,012 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:48:01,013 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:48:01,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:01,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:01,021 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-22 23:48:01,022 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:01,022 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:48:01,022 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:48:01,022 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:01,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:01,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:48:01,023 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:48:01,024 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:48:01,024 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:01,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:01,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:01,028 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:48:01,029 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:48:01,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:01,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:01,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:48:01,029 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:48:01,031 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:48:01,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:01,039 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:01,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:01,050 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:48:01,050 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:48:01,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:01,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:01,051 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:48:01,051 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:48:01,052 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-22 23:48:01,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:01,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:01,054 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:01,055 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:48:01,055 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:48:01,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:01,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:01,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:48:01,055 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:48:01,056 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:48:01,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:01,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:01,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-22 23:48:01,058 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:48:01,058 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:48:01,058 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:01,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:01,059 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:48:01,059 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:48:01,060 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:48:01,060 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:01,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:01,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:01,066 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:48:01,066 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:48:01,066 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:01,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:01,066 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:48:01,067 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:48:01,068 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-22 23:48:01,069 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:01,081 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:01,081 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:01,081 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:48:01,082 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:48:01,082 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:01,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:01,082 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:48:01,082 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:48:01,085 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-22 23:48:01,085 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:01,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:01,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:01,112 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:48:01,112 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:48:01,112 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:01,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:01,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:48:01,113 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-22 23:48:01,116 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-22 23:48:01,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:01,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:01,124 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-22 23:48:01,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:01,124 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:48:01,125 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:48:01,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:01,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:01,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:48:01,125 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:48:01,126 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:48:01,126 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:01,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:01,128 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:01,128 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:48:01,128 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:48:01,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:01,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:01,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:48:01,129 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:48:01,129 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:48:01,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:01,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:01,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:01,133 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:48:01,134 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:48:01,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:01,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:01,134 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:48:01,134 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:48:01,134 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 23:48:01,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:01,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:01,136 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:01,137 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:48:01,137 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:48:01,137 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:01,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:01,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:48:01,137 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:48:01,138 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:48:01,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:01,139 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:01,139 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:01,139 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:48:01,140 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:48:01,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:01,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:01,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:48:01,140 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:48:01,140 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:48:01,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:01,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:01,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:01,143 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:48:01,143 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:48:01,143 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:01,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:01,143 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:48:01,143 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:48:01,144 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 23:48:01,144 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:01,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:01,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:01,149 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:48:01,149 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:48:01,150 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:01,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:01,150 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:48:01,150 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:48:01,151 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 23:48:01,151 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:01,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:01,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:01,159 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:48:01,159 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-22 23:48:01,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:01,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:01,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:48:01,159 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-22 23:48:01,160 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:48:01,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:01,218 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:01,218 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-22 23:48:01,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:01,219 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:48:01,219 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:48:01,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:01,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:01,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:48:01,219 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-22 23:48:01,220 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:48:01,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:01,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:01,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:01,223 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:48:01,223 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:48:01,223 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:01,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:01,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:48:01,224 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-22 23:48:01,224 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:48:01,225 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:01,231 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:01,232 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:01,232 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:48:01,232 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:48:01,232 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:01,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:01,232 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:48:01,232 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-22 23:48:01,233 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-22 23:48:01,233 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:01,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:01,236 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:01,237 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:48:01,237 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:48:01,237 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:01,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:01,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:48:01,237 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-22 23:48:01,238 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:48:01,238 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:01,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:01,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:01,241 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:48:01,241 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:48:01,241 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:01,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:01,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:48:01,241 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-22 23:48:01,242 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:48:01,243 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:01,245 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:01,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:01,246 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:48:01,246 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:48:01,246 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:01,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:01,246 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:48:01,247 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-22 23:48:01,248 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-22 23:48:01,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:01,261 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:01,262 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:01,262 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:48:01,262 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:48:01,262 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:01,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:01,262 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:48:01,263 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-22 23:48:01,264 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-22 23:48:01,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:01,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:01,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:48:01,291 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-22 23:48:01,291 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-22 23:48:01,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:48:01,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:48:01,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:48:01,292 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-22 23:48:01,293 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:48:01,293 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:48:01,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:48:01,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:48:01,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:48:01,309 INFO L87 Difference]: Start difference. First operand 371 states and 537 transitions. cyclomatic complexity: 167 Second operand 3 states. [2018-11-22 23:48:01,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:48:01,739 INFO L93 Difference]: Finished difference Result 656 states and 915 transitions. [2018-11-22 23:48:01,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:48:01,740 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 656 states and 915 transitions. [2018-11-22 23:48:01,745 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 654 [2018-11-22 23:48:01,749 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 656 states to 656 states and 915 transitions. [2018-11-22 23:48:01,750 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 656 [2018-11-22 23:48:01,751 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 656 [2018-11-22 23:48:01,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 656 states and 915 transitions. [2018-11-22 23:48:01,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:48:01,753 INFO L705 BuchiCegarLoop]: Abstraction has 656 states and 915 transitions. [2018-11-22 23:48:01,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states and 915 transitions. [2018-11-22 23:48:01,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2018-11-22 23:48:01,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2018-11-22 23:48:01,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 915 transitions. [2018-11-22 23:48:01,769 INFO L728 BuchiCegarLoop]: Abstraction has 656 states and 915 transitions. [2018-11-22 23:48:01,769 INFO L608 BuchiCegarLoop]: Abstraction has 656 states and 915 transitions. [2018-11-22 23:48:01,769 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-22 23:48:01,769 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 656 states and 915 transitions. [2018-11-22 23:48:01,772 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 654 [2018-11-22 23:48:01,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:48:01,772 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:48:01,774 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-22 23:48:01,774 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:48:01,774 INFO L794 eck$LassoCheckResult]: Stem: 1790#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 1664#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 1665#L606-2 [2018-11-22 23:48:01,775 INFO L796 eck$LassoCheckResult]: Loop: 1665#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1768#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 1769#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); 1916#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; 1678#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 2184#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 2182#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 2180#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); 2178#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 2176#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); 2174#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 2172#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); 2170#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 2168#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)); 2166#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); 2164#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); 2162#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); 2159#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 2157#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); 2155#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 2153#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 2151#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 2149#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); 2147#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); 2145#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 2143#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); 2141#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 2139#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 2137#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); 2135#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 2133#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); 2131#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); 2129#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 2127#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 2125#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 2122#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 2120#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); 2118#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 2116#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 2114#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 2112#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); 2110#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 2108#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 2106#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); 2104#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 2102#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); 2100#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); 2098#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 2096#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); 2094#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 2092#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 2089#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)); 2087#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); 2085#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; 1776#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1665#L606-2 [2018-11-22 23:48:01,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:48:01,776 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-22 23:48:01,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:48:01,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:48:01,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:48:01,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:48:01,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:48:01,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:48:01,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:48:01,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:48:01,787 INFO L82 PathProgramCache]: Analyzing trace with hash -695559695, now seen corresponding path program 1 times [2018-11-22 23:48:01,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:48:01,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:48:01,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:48:01,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:48:01,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:48:01,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:48:01,852 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:48:01,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:48:01,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 23:48:01,853 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 23:48:01,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 23:48:01,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-22 23:48:01,853 INFO L87 Difference]: Start difference. First operand 656 states and 915 transitions. cyclomatic complexity: 260 Second operand 4 states. [2018-11-22 23:48:02,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:48:02,596 INFO L93 Difference]: Finished difference Result 1220 states and 1693 transitions. [2018-11-22 23:48:02,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 23:48:02,596 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1220 states and 1693 transitions. [2018-11-22 23:48:02,603 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1216 [2018-11-22 23:48:02,609 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1220 states to 1220 states and 1693 transitions. [2018-11-22 23:48:02,610 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1220 [2018-11-22 23:48:02,611 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1220 [2018-11-22 23:48:02,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1220 states and 1693 transitions. [2018-11-22 23:48:02,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:48:02,613 INFO L705 BuchiCegarLoop]: Abstraction has 1220 states and 1693 transitions. [2018-11-22 23:48:02,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states and 1693 transitions. [2018-11-22 23:48:02,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 1217. [2018-11-22 23:48:02,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2018-11-22 23:48:02,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1687 transitions. [2018-11-22 23:48:02,634 INFO L728 BuchiCegarLoop]: Abstraction has 1217 states and 1687 transitions. [2018-11-22 23:48:02,634 INFO L608 BuchiCegarLoop]: Abstraction has 1217 states and 1687 transitions. [2018-11-22 23:48:02,634 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-22 23:48:02,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1217 states and 1687 transitions. [2018-11-22 23:48:02,639 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1213 [2018-11-22 23:48:02,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:48:02,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:48:02,641 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-22 23:48:02,641 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:48:02,642 INFO L794 eck$LassoCheckResult]: Stem: 3677#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 3546#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 3547#L606-2 [2018-11-22 23:48:02,642 INFO L796 eck$LassoCheckResult]: Loop: 3547#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4464#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 4462#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); 4460#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 4458#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); 4456#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 4454#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); 4295#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; 3735#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4273#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4271#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 4269#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; 3655#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3796#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3656#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 3657#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); 4151#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 4150#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); 4148#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 4146#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); 4144#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 4142#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)); 4140#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); 4138#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); 4136#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); 4134#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 4132#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); 4130#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 4128#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 4126#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 4124#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); 4122#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); 4120#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 4118#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); 4116#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 4114#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 4112#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); 4110#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 4108#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); 4106#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); 4104#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 4102#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 4100#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 4098#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 4096#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); 4094#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 4092#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 4090#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 4088#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); 4086#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 4084#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 4082#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); 4080#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 4078#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); 4076#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); 4074#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 4072#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); 4070#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 4068#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 4066#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)); 4064#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); 4061#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; 4062#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3547#L606-2 [2018-11-22 23:48:02,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:48:02,642 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-22 23:48:02,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:48:02,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:48:02,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:48:02,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:48:02,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:48:02,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:48:02,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:48:02,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:48:02,648 INFO L82 PathProgramCache]: Analyzing trace with hash -917902191, now seen corresponding path program 1 times [2018-11-22 23:48:02,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:48:02,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:48:02,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:48:02,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:48:02,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:48:02,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:48:02,688 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-22 23:48:02,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:48:02,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:48:02,689 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 23:48:02,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:48:02,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:48:02,689 INFO L87 Difference]: Start difference. First operand 1217 states and 1687 transitions. cyclomatic complexity: 472 Second operand 3 states. [2018-11-22 23:48:03,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:48:03,183 INFO L93 Difference]: Finished difference Result 1499 states and 1993 transitions. [2018-11-22 23:48:03,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:48:03,185 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1499 states and 1993 transitions. [2018-11-22 23:48:03,193 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1495 [2018-11-22 23:48:03,200 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1499 states to 1499 states and 1993 transitions. [2018-11-22 23:48:03,201 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1499 [2018-11-22 23:48:03,202 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1499 [2018-11-22 23:48:03,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1499 states and 1993 transitions. [2018-11-22 23:48:03,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:48:03,205 INFO L705 BuchiCegarLoop]: Abstraction has 1499 states and 1993 transitions. [2018-11-22 23:48:03,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states and 1993 transitions. [2018-11-22 23:48:03,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1498. [2018-11-22 23:48:03,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1498 states. [2018-11-22 23:48:03,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1498 states to 1498 states and 1991 transitions. [2018-11-22 23:48:03,228 INFO L728 BuchiCegarLoop]: Abstraction has 1498 states and 1991 transitions. [2018-11-22 23:48:03,228 INFO L608 BuchiCegarLoop]: Abstraction has 1498 states and 1991 transitions. [2018-11-22 23:48:03,228 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-22 23:48:03,228 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1498 states and 1991 transitions. [2018-11-22 23:48:03,233 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1494 [2018-11-22 23:48:03,234 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:48:03,234 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:48:03,235 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-22 23:48:03,236 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:48:03,236 INFO L794 eck$LassoCheckResult]: Stem: 6389#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 6268#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 6269#L606-2 [2018-11-22 23:48:03,236 INFO L796 eck$LassoCheckResult]: Loop: 6269#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7269#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 7267#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); 7266#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 7265#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); 7263#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 7261#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); 7258#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 7257#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)); 7256#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); 7254#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); 7252#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); 7251#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 7250#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); 7249#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 7247#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 7245#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 7243#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; 6497#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6877#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6875#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6873#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; 6486#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6891#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6879#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6878#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); 6876#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 6874#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); 6872#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6870#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); 6868#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 6866#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)); 6864#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); 6862#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); 6860#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); 6858#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 6856#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); 6854#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 6852#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 6850#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 6848#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); 6846#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); 6844#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 6842#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); 6840#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 6838#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 6836#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); 6834#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 6832#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); 6830#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); 6828#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 6826#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 6824#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 6822#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 6820#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); 6818#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 6816#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6814#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 6812#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); 6810#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 6808#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 6806#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); 6804#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6802#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); 6800#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); 6798#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 6796#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); 6794#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 6792#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 6790#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)); 6788#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); 6785#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; 6786#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6269#L606-2 [2018-11-22 23:48:03,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:48:03,236 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-22 23:48:03,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:48:03,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:48:03,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:48:03,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:48:03,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:48:03,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:48:03,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:48:03,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:48:03,241 INFO L82 PathProgramCache]: Analyzing trace with hash -925782543, now seen corresponding path program 1 times [2018-11-22 23:48:03,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:48:03,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:48:03,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:48:03,242 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:48:03,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:48:03,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:48:03,290 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-22 23:48:03,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:48:03,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:48:03,290 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 23:48:03,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:48:03,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:48:03,291 INFO L87 Difference]: Start difference. First operand 1498 states and 1991 transitions. cyclomatic complexity: 495 Second operand 3 states. [2018-11-22 23:48:03,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:48:03,792 INFO L93 Difference]: Finished difference Result 1497 states and 1811 transitions. [2018-11-22 23:48:03,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:48:03,794 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1497 states and 1811 transitions. [2018-11-22 23:48:03,801 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1494 [2018-11-22 23:48:03,808 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1497 states to 1497 states and 1811 transitions. [2018-11-22 23:48:03,808 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1497 [2018-11-22 23:48:03,809 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1497 [2018-11-22 23:48:03,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1497 states and 1811 transitions. [2018-11-22 23:48:03,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:48:03,812 INFO L705 BuchiCegarLoop]: Abstraction has 1497 states and 1811 transitions. [2018-11-22 23:48:03,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states and 1811 transitions. [2018-11-22 23:48:03,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1497. [2018-11-22 23:48:03,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1497 states. [2018-11-22 23:48:03,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 1811 transitions. [2018-11-22 23:48:03,833 INFO L728 BuchiCegarLoop]: Abstraction has 1497 states and 1811 transitions. [2018-11-22 23:48:03,833 INFO L608 BuchiCegarLoop]: Abstraction has 1497 states and 1811 transitions. [2018-11-22 23:48:03,833 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-22 23:48:03,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1497 states and 1811 transitions. [2018-11-22 23:48:03,839 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1494 [2018-11-22 23:48:03,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:48:03,839 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:48:03,840 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-22 23:48:03,840 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:48:03,840 INFO L794 eck$LassoCheckResult]: Stem: 9397#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 9269#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 9270#L606-2 [2018-11-22 23:48:03,841 INFO L796 eck$LassoCheckResult]: Loop: 9270#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 10139#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 10137#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); 10135#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 10133#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); 10131#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 10129#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); 10119#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 10120#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)); 10114#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); 10115#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); 10690#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); 10689#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 10688#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); 10687#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 10686#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 10685#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 9841#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); 9842#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); 9997#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 9993#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); 9990#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 9987#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 9981#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); 9976#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 9971#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); 9966#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); 9961#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 9733#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; 9627#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9728#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 9726#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 9724#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); 9722#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 9720#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); 9718#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 9716#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); 9714#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 9712#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)); 9710#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); 9708#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); 9706#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); 9704#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 9702#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); 9700#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 9698#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 9696#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 9694#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); 9692#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); 9690#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 9688#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); 9686#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 9684#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 9682#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); 9680#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 9678#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); 9676#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); 9673#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 9671#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 9669#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 9667#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 9665#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); 9663#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 9661#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 9659#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 9657#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); 9655#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 9653#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 9651#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); 9649#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 9647#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); 9645#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); 9643#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 9641#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); 9639#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 9637#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 9635#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)); 9633#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); 9630#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; 9631#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9270#L606-2 [2018-11-22 23:48:03,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:48:03,841 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-22 23:48:03,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:48:03,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:48:03,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:48:03,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:48:03,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:48:03,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:48:03,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:48:03,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:48:03,846 INFO L82 PathProgramCache]: Analyzing trace with hash -568851643, now seen corresponding path program 1 times [2018-11-22 23:48:03,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:48:03,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:48:03,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:48:03,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:48:03,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:48:03,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:48:03,899 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:48:03,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:48:03,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:48:03,899 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 23:48:03,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:48:03,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:48:03,900 INFO L87 Difference]: Start difference. First operand 1497 states and 1811 transitions. cyclomatic complexity: 316 Second operand 3 states. [2018-11-22 23:48:04,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:48:04,210 INFO L93 Difference]: Finished difference Result 1486 states and 1767 transitions. [2018-11-22 23:48:04,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:48:04,212 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1486 states and 1767 transitions. [2018-11-22 23:48:04,219 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1483 [2018-11-22 23:48:04,224 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1486 states to 1486 states and 1767 transitions. [2018-11-22 23:48:04,225 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1486 [2018-11-22 23:48:04,226 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1486 [2018-11-22 23:48:04,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1486 states and 1767 transitions. [2018-11-22 23:48:04,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:48:04,229 INFO L705 BuchiCegarLoop]: Abstraction has 1486 states and 1767 transitions. [2018-11-22 23:48:04,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states and 1767 transitions. [2018-11-22 23:48:04,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1486. [2018-11-22 23:48:04,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1486 states. [2018-11-22 23:48:04,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 1767 transitions. [2018-11-22 23:48:04,249 INFO L728 BuchiCegarLoop]: Abstraction has 1486 states and 1767 transitions. [2018-11-22 23:48:04,249 INFO L608 BuchiCegarLoop]: Abstraction has 1486 states and 1767 transitions. [2018-11-22 23:48:04,249 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-22 23:48:04,249 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1486 states and 1767 transitions. [2018-11-22 23:48:04,255 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1483 [2018-11-22 23:48:04,255 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:48:04,255 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:48:04,256 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-22 23:48:04,256 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:48:04,256 INFO L794 eck$LassoCheckResult]: Stem: 12375#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 12258#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 12259#L606-2 [2018-11-22 23:48:04,257 INFO L796 eck$LassoCheckResult]: Loop: 12259#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 13012#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 13010#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); 13008#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 13006#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); 13004#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 13002#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); 13000#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 12998#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)); 12994#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); 12993#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); 12991#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); 12989#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 12987#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); 12985#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 12983#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 12982#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 12981#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); 12979#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); 12977#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 12975#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); 12973#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 12971#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 12969#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); 12967#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12965#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); 12963#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); 12961#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 12792#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 12793#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 13592#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 13590#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); 13588#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 13586#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 13584#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 13582#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); 13580#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 13578#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 13576#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); 13574#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 13572#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); 13308#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); 13307#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 13306#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); 13304#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 12800#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 12801#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)); 13310#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); 12873#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); 12862#L259 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && (((9 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)); 12861#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); 12859#L276 assume !(7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 1 == ~a21~0 && 1 == ~a19~0 && 5 == calculate_output_~input && !(1 == ~a11~0)); 12857#L280 assume !(8 == ~a28~0 && 1 == ~a21~0 && (!(1 == ~a11~0) && (1 == calculate_output_~input && 8 == ~a17~0) && 1 == ~a19~0) && 1 == ~a25~0); 12856#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); 12855#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); 12853#L291 assume !(8 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a11~0) && 1 == ~a25~0 && 8 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a19~0); 12851#L293 assume !((1 == ~a19~0 && 8 == ~a17~0 && ((!(1 == ~a25~0) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a11~0)) && 11 == ~a28~0); 12849#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); 12848#L309 assume !((((((3 == calculate_output_~input && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)) && 11 == ~a28~0) && !(1 == ~a11~0)); 12846#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); 12845#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); 12844#L331 assume !((!(1 == ~a11~0) && (((4 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0) && 11 == ~a28~0) && 1 == ~a19~0); 12842#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)); 12841#L349 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && ((1 == ~a25~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 11 == ~a28~0) && 1 == ~a21~0); 12839#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); 12838#L361 assume !(1 == ~a19~0 && ((1 == ~a21~0 && (!(1 == ~a25~0) && 3 == calculate_output_~input) && 9 == ~a17~0) && 8 == ~a28~0) && 1 == ~a11~0); 12837#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)); 12836#L375 assume !(1 == ~a19~0 && (((8 == ~a17~0 && 5 == calculate_output_~input && !(1 == ~a11~0)) && 1 == ~a21~0) && 1 == ~a25~0) && 8 == ~a28~0); 12834#L378 assume !(((!(1 == ~a11~0) && ((1 == ~a21~0 && 4 == calculate_output_~input) && 10 == ~a28~0) && 8 == ~a17~0) && !(1 == ~a19~0)) && 1 == ~a25~0); 12833#L380 assume !(8 == ~a28~0 && (1 == ~a19~0 && 1 == ~a11~0 && !(1 == ~a25~0) && 9 == ~a17~0 && 6 == calculate_output_~input) && 1 == ~a21~0); 12831#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)); 12829#L394 assume !(((((!(1 == ~a25~0) && 1 == ~a19~0 && 3 == calculate_output_~input) && 9 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 12827#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)); 12825#L402 assume !(((!(1 == ~a11~0) && ((1 == ~a19~0 && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)); 12823#L404 assume !((1 == ~a11~0 && 1 == ~a19~0 && 1 == ~a21~0 && (9 == ~a17~0 && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 8 == ~a28~0); 12821#L407 assume !(!(1 == ~a11~0) && 1 == ~a21~0 && (1 == ~a19~0 && 8 == ~a17~0 && 1 == ~a25~0 && 5 == calculate_output_~input) && 11 == ~a28~0); 12819#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); 12817#L414 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12816#L414-2 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12815#L417-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12813#L420-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12811#L423-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12810#L426-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12808#L429-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12806#L432-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12804#L435-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12275#L438-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12921#L441-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12919#L444-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12917#L447-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12915#L450-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12913#L453-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12911#L456-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12909#L459-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12907#L462-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12905#L465-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12469#L468-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12903#L471-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12901#L474-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12900#L477-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12898#L480-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12896#L483-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12894#L486-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12892#L489-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12890#L492-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12888#L495-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12886#L498-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12884#L501-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12882#L504-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12880#L507-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12878#L510-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12876#L513-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12406#L516-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13065#L519-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13063#L522-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13061#L525-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13059#L528-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13057#L531-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13055#L534-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13053#L537-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13051#L540-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13049#L543-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13047#L546-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13045#L549-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13043#L552-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13041#L555-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13039#L558-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13037#L561-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13035#L564-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13034#L567-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13033#L570-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13032#L573-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13030#L576-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13028#L579-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13026#L582-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13024#L585-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13021#L588-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13019#L591-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13017#L594-1 calculate_output_#res := -2; 13015#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 12259#L606-2 [2018-11-22 23:48:04,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:48:04,258 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-22 23:48:04,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:48:04,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:48:04,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:48:04,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:48:04,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:48:04,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:48:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:48:04,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:48:04,263 INFO L82 PathProgramCache]: Analyzing trace with hash 2053340219, now seen corresponding path program 1 times [2018-11-22 23:48:04,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:48:04,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:48:04,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:48:04,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:48:04,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:48:04,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:48:04,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:48:04,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:48:04,315 INFO L82 PathProgramCache]: Analyzing trace with hash 41143549, now seen corresponding path program 1 times [2018-11-22 23:48:04,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:48:04,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:48:04,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:48:04,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:48:04,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:48:04,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:48:04,759 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-22 23:48:04,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:48:04,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-22 23:48:05,522 WARN L180 SmtUtils]: Spent 742.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2018-11-22 23:48:05,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-22 23:48:05,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-22 23:48:05,613 INFO L87 Difference]: Start difference. First operand 1486 states and 1767 transitions. cyclomatic complexity: 284 Second operand 10 states. [2018-11-22 23:48:06,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:48:06,617 INFO L93 Difference]: Finished difference Result 1676 states and 1954 transitions. [2018-11-22 23:48:06,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-22 23:48:06,618 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1676 states and 1954 transitions. [2018-11-22 23:48:06,624 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1621 [2018-11-22 23:48:06,631 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1676 states to 1676 states and 1954 transitions. [2018-11-22 23:48:06,631 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1676 [2018-11-22 23:48:06,633 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1676 [2018-11-22 23:48:06,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1676 states and 1954 transitions. [2018-11-22 23:48:06,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:48:06,636 INFO L705 BuchiCegarLoop]: Abstraction has 1676 states and 1954 transitions. [2018-11-22 23:48:06,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states and 1954 transitions. [2018-11-22 23:48:06,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1535. [2018-11-22 23:48:06,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1535 states. [2018-11-22 23:48:06,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 1813 transitions. [2018-11-22 23:48:06,658 INFO L728 BuchiCegarLoop]: Abstraction has 1535 states and 1813 transitions. [2018-11-22 23:48:06,658 INFO L608 BuchiCegarLoop]: Abstraction has 1535 states and 1813 transitions. [2018-11-22 23:48:06,658 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-22 23:48:06,658 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1535 states and 1813 transitions. [2018-11-22 23:48:06,664 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1480 [2018-11-22 23:48:06,664 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:48:06,665 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:48:06,665 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-22 23:48:06,665 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:48:06,665 INFO L794 eck$LassoCheckResult]: Stem: 15563#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 15445#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 15446#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16324#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 16322#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); 16213#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; 15813#L597 [2018-11-22 23:48:06,665 INFO L796 eck$LassoCheckResult]: Loop: 15813#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 16199#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16197#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 16195#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); 16193#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 16191#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); 16190#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 16189#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; 15813#L597 [2018-11-22 23:48:06,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:48:06,666 INFO L82 PathProgramCache]: Analyzing trace with hash 889694475, now seen corresponding path program 1 times [2018-11-22 23:48:06,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:48:06,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:48:06,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:48:06,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:48:06,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:48:06,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:48:06,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:48:06,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:48:06,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1141479969, now seen corresponding path program 1 times [2018-11-22 23:48:06,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:48:06,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:48:06,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:48:06,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:48:06,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:48:06,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:48:06,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:48:06,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:48:06,679 INFO L82 PathProgramCache]: Analyzing trace with hash 2047121707, now seen corresponding path program 1 times [2018-11-22 23:48:06,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:48:06,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:48:06,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:48:06,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:48:06,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:48:06,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:48:06,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:48:06,902 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 23:48:06,902 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 23:48:06,903 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 23:48:06,903 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 23:48:06,903 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-22 23:48:06,903 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 23:48:06,903 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 23:48:06,903 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 23:48:06,903 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label57_true-unreach-call_false-termination.c_Iteration8_Lasso [2018-11-22 23:48:06,903 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 23:48:06,903 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 23:48:06,905 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-22 23:48:06,911 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-22 23:48:06,913 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-22 23:48:06,914 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-22 23:48:06,916 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-22 23:48:06,918 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-22 23:48:06,926 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-22 23:48:06,930 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-22 23:48:06,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:48:06,935 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-22 23:48:06,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:48:06,940 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-22 23:48:06,943 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-22 23:48:06,945 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-22 23:48:06,948 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-22 23:48:06,950 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-22 23:48:06,960 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-22 23:48:06,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:48:06,975 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-22 23:48:06,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:48:06,982 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-22 23:48:07,126 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 23:48:07,127 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_365dddb1-665b-48fe-9023-27937ea9c5e7/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-22 23:48:07,132 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 23:48:07,132 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 23:48:07,134 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 23:48:07,134 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_365dddb1-665b-48fe-9023-27937ea9c5e7/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-22 23:48:07,154 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 23:48:07,154 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 23:48:07,156 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 23:48:07,156 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_365dddb1-665b-48fe-9023-27937ea9c5e7/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-22 23:48:07,174 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 23:48:07,174 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 23:48:07,177 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 23:48:07,177 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_365dddb1-665b-48fe-9023-27937ea9c5e7/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-22 23:48:07,196 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 23:48:07,196 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 23:48:07,198 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 23:48:07,198 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_365dddb1-665b-48fe-9023-27937ea9c5e7/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-22 23:48:07,219 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 23:48:07,219 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 23:48:07,222 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 23:48:07,222 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_365dddb1-665b-48fe-9023-27937ea9c5e7/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-22 23:48:07,243 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 23:48:07,243 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 23:48:07,245 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 23:48:07,246 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_365dddb1-665b-48fe-9023-27937ea9c5e7/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-22 23:48:07,267 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 23:48:07,267 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 23:48:07,269 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 23:48:07,269 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_365dddb1-665b-48fe-9023-27937ea9c5e7/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-22 23:48:07,289 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 23:48:07,289 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 23:48:07,292 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 23:48:07,292 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_365dddb1-665b-48fe-9023-27937ea9c5e7/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-22 23:48:07,312 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 23:48:07,312 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 23:48:07,315 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 23:48:07,315 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_365dddb1-665b-48fe-9023-27937ea9c5e7/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-22 23:48:07,336 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 23:48:07,336 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 23:48:07,338 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 23:48:07,338 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_365dddb1-665b-48fe-9023-27937ea9c5e7/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-22 23:48:07,358 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 23:48:07,358 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 23:48:07,360 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 23:48:07,360 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_365dddb1-665b-48fe-9023-27937ea9c5e7/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-22 23:48:07,380 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 23:48:07,380 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 23:48:07,382 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 23:48:07,382 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_365dddb1-665b-48fe-9023-27937ea9c5e7/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-22 23:48:07,402 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 23:48:07,403 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 23:48:07,405 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 23:48:07,406 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_365dddb1-665b-48fe-9023-27937ea9c5e7/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-22 23:48:07,426 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 23:48:07,426 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 23:48:07,428 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 23:48:07,428 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_365dddb1-665b-48fe-9023-27937ea9c5e7/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-22 23:48:07,449 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 23:48:07,449 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 23:48:07,452 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 23:48:07,452 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_365dddb1-665b-48fe-9023-27937ea9c5e7/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-22 23:48:07,472 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 23:48:07,472 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_365dddb1-665b-48fe-9023-27937ea9c5e7/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-22 23:48:07,496 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-22 23:48:07,496 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 23:48:07,715 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 23:48:07,715 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_365dddb1-665b-48fe-9023-27937ea9c5e7/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-22 23:48:07,734 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 23:48:07,734 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 23:48:07,737 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 23:48:07,737 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_365dddb1-665b-48fe-9023-27937ea9c5e7/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-22 23:48:07,756 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 23:48:07,757 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_365dddb1-665b-48fe-9023-27937ea9c5e7/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-22 23:48:07,778 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-22 23:48:07,778 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 23:48:07,954 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 23:48:07,954 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_365dddb1-665b-48fe-9023-27937ea9c5e7/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-22 23:48:07,973 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 23:48:07,973 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 23:48:07,975 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 23:48:07,975 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_365dddb1-665b-48fe-9023-27937ea9c5e7/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-22 23:48:07,994 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 23:48:07,994 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 23:48:07,996 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 23:48:07,996 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_365dddb1-665b-48fe-9023-27937ea9c5e7/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-22 23:48:08,016 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 23:48:08,016 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 23:48:08,019 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 23:48:08,019 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a28~0=0} Honda state: {~a28~0=10} Generalized eigenvectors: [] Lambdas: [] Nus: [] ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~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; [?] havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; [?] assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; [?] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; [?] 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); [?] 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; [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] 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); [L35-L413] assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0); [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] 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); [L35-L413] assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0); [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(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) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(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) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [L603] ~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] #res := 22; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [L603] ~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] #res := 22; [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND TRUE ((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1))) [L36] a28 = 10 [L37] return 22; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; [?] assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; [?] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; [?] 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); [?] assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); [?] 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); [?] assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); [?] 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; [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] 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); [L35-L413] assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); [L38-L413] 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); [L42-L413] assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); [L47-L413] 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; [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] 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); [L35-L413] assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); [L38-L413] 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); [L42-L413] assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); [L47-L413] 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; [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(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) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(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) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((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 [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(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) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(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) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((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 [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; [L614] ~output~0 := #t~ret3; [L614] havoc #t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == ~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == ~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((8 == ~a17~0 && ((1 == ~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0 [L48] ~a25~0 := 0; [L49] #res := -1; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L614] ~output~0 := #t~ret3; [L614] havoc #t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == ~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == ~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((8 == ~a17~0 && ((1 == ~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0 [L48] ~a25~0 := 0; [L49] #res := -1; [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND TRUE ((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10)) [L48] a25 = 0 [L49] return -1; ----- [2018-11-22 23:48:08,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.11 11:48:08 BoogieIcfgContainer [2018-11-22 23:48:08,067 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-22 23:48:08,068 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 23:48:08,068 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 23:48:08,068 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 23:48:08,068 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:47:57" (3/4) ... [2018-11-22 23:48:08,074 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~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; [?] havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; [?] assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; [?] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; [?] 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); [?] 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; [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] 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); [L35-L413] assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0); [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] 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); [L35-L413] assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0); [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(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) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(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) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [L603] ~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] #res := 22; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [L603] ~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] #res := 22; [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND TRUE ((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1))) [L36] a28 = 10 [L37] return 22; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; [?] assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; [?] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; [?] 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); [?] assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); [?] 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); [?] assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); [?] 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; [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] 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); [L35-L413] assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); [L38-L413] 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); [L42-L413] assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); [L47-L413] 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; [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] 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); [L35-L413] assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); [L38-L413] 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); [L42-L413] assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); [L47-L413] 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; [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(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) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(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) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((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 [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(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) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(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) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((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 [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; [L614] ~output~0 := #t~ret3; [L614] havoc #t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == ~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == ~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((8 == ~a17~0 && ((1 == ~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0 [L48] ~a25~0 := 0; [L49] #res := -1; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L614] ~output~0 := #t~ret3; [L614] havoc #t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == ~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == ~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((8 == ~a17~0 && ((1 == ~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0 [L48] ~a25~0 := 0; [L49] #res := -1; [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND TRUE ((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10)) [L48] a25 = 0 [L49] return -1; ----- [2018-11-22 23:48:08,160 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_365dddb1-665b-48fe-9023-27937ea9c5e7/bin-2019/uautomizer/witness.graphml [2018-11-22 23:48:08,160 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 23:48:08,161 INFO L168 Benchmark]: Toolchain (without parser) took 12827.78 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 456.7 MB). Free memory was 953.9 MB in the beginning and 1.4 GB in the end (delta: -426.7 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. [2018-11-22 23:48:08,161 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 23:48:08,161 INFO L168 Benchmark]: CACSL2BoogieTranslator took 435.79 ms. Allocated memory is still 1.0 GB. Free memory was 953.9 MB in the beginning and 918.8 MB in the end (delta: 35.0 MB). Peak memory consumption was 35.0 MB. Max. memory is 11.5 GB. [2018-11-22 23:48:08,162 INFO L168 Benchmark]: Boogie Procedure Inliner took 132.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 918.8 MB in the beginning and 1.1 GB in the end (delta: -215.2 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2018-11-22 23:48:08,162 INFO L168 Benchmark]: Boogie Preprocessor took 49.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-22 23:48:08,163 INFO L168 Benchmark]: RCFGBuilder took 1179.69 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: 100.6 MB). Peak memory consumption was 100.6 MB. Max. memory is 11.5 GB. [2018-11-22 23:48:08,163 INFO L168 Benchmark]: BuchiAutomizer took 10934.12 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 314.6 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -352.8 MB). Peak memory consumption was 489.8 MB. Max. memory is 11.5 GB. [2018-11-22 23:48:08,163 INFO L168 Benchmark]: Witness Printer took 92.19 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 293.6 kB). Peak memory consumption was 293.6 kB. Max. memory is 11.5 GB. [2018-11-22 23:48:08,166 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 435.79 ms. Allocated memory is still 1.0 GB. Free memory was 953.9 MB in the beginning and 918.8 MB in the end (delta: 35.0 MB). Peak memory consumption was 35.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 132.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 918.8 MB in the beginning and 1.1 GB in the end (delta: -215.2 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1179.69 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: 100.6 MB). Peak memory consumption was 100.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10934.12 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 314.6 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -352.8 MB). Peak memory consumption was 489.8 MB. Max. memory is 11.5 GB. * Witness Printer took 92.19 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 293.6 kB). Peak memory consumption was 293.6 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (7 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.7 modules have a trivial ranking function, the largest among these consists of 10 locations. The remainder module has 1535 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.8s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 6.1s. Construction of modules took 3.1s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 146 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 1535 states and ocurred in iteration 7. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1458 SDtfs, 2472 SDslu, 549 SDs, 0 SdLazy, 3949 SolverSat, 844 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s 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: 88ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 0 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 31 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.8s - 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@59c6c71=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@27091914=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@59c6c71=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@27091914=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@59c6c71=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@27091914=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 ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~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; [?] havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; [?] assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; [?] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; [?] 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); [?] 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; [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] 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); [L35-L413] assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0); [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] 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); [L35-L413] assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0); [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(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) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(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) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [L603] ~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] #res := 22; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [L603] ~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] #res := 22; [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND TRUE ((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1))) [L36] a28 = 10 [L37] return 22; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; [?] assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; [?] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; [?] 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); [?] assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); [?] 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); [?] assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); [?] 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; [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] 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); [L35-L413] assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); [L38-L413] 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); [L42-L413] assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); [L47-L413] 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; [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] 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); [L35-L413] assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); [L38-L413] 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); [L42-L413] assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); [L47-L413] 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; [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(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) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(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) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((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 [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(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) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(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) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((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 [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; [L614] ~output~0 := #t~ret3; [L614] havoc #t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == ~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == ~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((8 == ~a17~0 && ((1 == ~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0 [L48] ~a25~0 := 0; [L49] #res := -1; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L614] ~output~0 := #t~ret3; [L614] havoc #t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == ~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == ~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((8 == ~a17~0 && ((1 == ~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0 [L48] ~a25~0 := 0; [L49] #res := -1; [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND TRUE ((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10)) [L48] a25 = 0 [L49] return -1; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~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; [?] havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; [?] assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; [?] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; [?] 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); [?] 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; [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] 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); [L35-L413] assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0); [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] 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); [L35-L413] assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0); [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(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) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(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) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [L603] ~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] #res := 22; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [L603] ~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] #res := 22; [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND TRUE ((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1))) [L36] a28 = 10 [L37] return 22; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; [?] assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; [?] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; [?] 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); [?] assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); [?] 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); [?] assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); [?] 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; [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] 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); [L35-L413] assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); [L38-L413] 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); [L42-L413] assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); [L47-L413] 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; [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] 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); [L35-L413] assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); [L38-L413] 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); [L42-L413] assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); [L47-L413] 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; [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(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) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(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) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((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 [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(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) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(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) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((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 [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; [L614] ~output~0 := #t~ret3; [L614] havoc #t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == ~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == ~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((8 == ~a17~0 && ((1 == ~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0 [L48] ~a25~0 := 0; [L49] #res := -1; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L614] ~output~0 := #t~ret3; [L614] havoc #t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == ~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == ~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((8 == ~a17~0 && ((1 == ~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0 [L48] ~a25~0 := 0; [L49] #res := -1; [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND TRUE ((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10)) [L48] a25 = 0 [L49] return -1; ----- Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND TRUE ((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1))) [L36] a28 = 10 [L37] return 22; Loop: [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND TRUE ((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10)) [L48] a25 = 0 [L49] return -1; End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...