./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label00_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_50675c4e-831b-4689-8e41-72f63fadd5f2/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_50675c4e-831b-4689-8e41-72f63fadd5f2/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_50675c4e-831b-4689-8e41-72f63fadd5f2/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_50675c4e-831b-4689-8e41-72f63fadd5f2/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label00_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_50675c4e-831b-4689-8e41-72f63fadd5f2/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_50675c4e-831b-4689-8e41-72f63fadd5f2/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 e521cfa02db8c2eac8727300620f5ffec2ecc0c7 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 12:39:22,204 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 12:39:22,205 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 12:39:22,213 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 12:39:22,213 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 12:39:22,214 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 12:39:22,214 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 12:39:22,216 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 12:39:22,217 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 12:39:22,217 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 12:39:22,217 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 12:39:22,218 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 12:39:22,218 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 12:39:22,219 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 12:39:22,220 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 12:39:22,220 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 12:39:22,221 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 12:39:22,222 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 12:39:22,223 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 12:39:22,224 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 12:39:22,225 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 12:39:22,226 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 12:39:22,228 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 12:39:22,228 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 12:39:22,228 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 12:39:22,229 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 12:39:22,230 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 12:39:22,230 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 12:39:22,231 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 12:39:22,232 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 12:39:22,232 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 12:39:22,232 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 12:39:22,233 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 12:39:22,233 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 12:39:22,233 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 12:39:22,234 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 12:39:22,234 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_50675c4e-831b-4689-8e41-72f63fadd5f2/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 12:39:22,245 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 12:39:22,245 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 12:39:22,246 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 12:39:22,246 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 12:39:22,247 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 12:39:22,247 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 12:39:22,247 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 12:39:22,247 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 12:39:22,247 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 12:39:22,247 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 12:39:22,248 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 12:39:22,248 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 12:39:22,248 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 12:39:22,248 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 12:39:22,248 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 12:39:22,248 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 12:39:22,248 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 12:39:22,249 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 12:39:22,249 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 12:39:22,249 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 12:39:22,249 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 12:39:22,249 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 12:39:22,249 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 12:39:22,249 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 12:39:22,250 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 12:39:22,250 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 12:39:22,250 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 12:39:22,250 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 12:39:22,250 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 12:39:22,250 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 12:39:22,250 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 12:39:22,251 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 12:39:22,251 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_50675c4e-831b-4689-8e41-72f63fadd5f2/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 -> e521cfa02db8c2eac8727300620f5ffec2ecc0c7 [2018-11-18 12:39:22,273 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 12:39:22,282 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 12:39:22,283 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 12:39:22,284 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 12:39:22,285 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 12:39:22,285 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_50675c4e-831b-4689-8e41-72f63fadd5f2/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label00_true-unreach-call_false-termination.c [2018-11-18 12:39:22,322 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_50675c4e-831b-4689-8e41-72f63fadd5f2/bin-2019/uautomizer/data/996f219b9/bd02647d566e441d9a0895b30ad3d1e0/FLAG8aa56168c [2018-11-18 12:39:22,777 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 12:39:22,777 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_50675c4e-831b-4689-8e41-72f63fadd5f2/sv-benchmarks/c/eca-rers2012/Problem02_label00_true-unreach-call_false-termination.c [2018-11-18 12:39:22,786 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_50675c4e-831b-4689-8e41-72f63fadd5f2/bin-2019/uautomizer/data/996f219b9/bd02647d566e441d9a0895b30ad3d1e0/FLAG8aa56168c [2018-11-18 12:39:22,797 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_50675c4e-831b-4689-8e41-72f63fadd5f2/bin-2019/uautomizer/data/996f219b9/bd02647d566e441d9a0895b30ad3d1e0 [2018-11-18 12:39:22,800 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 12:39:22,800 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 12:39:22,801 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 12:39:22,801 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 12:39:22,804 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 12:39:22,804 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:39:22" (1/1) ... [2018-11-18 12:39:22,806 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5abf726c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:39:22, skipping insertion in model container [2018-11-18 12:39:22,806 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:39:22" (1/1) ... [2018-11-18 12:39:22,812 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 12:39:22,841 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 12:39:23,058 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:39:23,062 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 12:39:23,128 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:39:23,140 INFO L195 MainTranslator]: Completed translation [2018-11-18 12:39:23,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:39:23 WrapperNode [2018-11-18 12:39:23,140 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 12:39:23,141 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 12:39:23,141 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 12:39:23,141 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 12:39:23,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:39:23" (1/1) ... [2018-11-18 12:39:23,208 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:39:23" (1/1) ... [2018-11-18 12:39:23,242 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 12:39:23,243 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 12:39:23,243 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 12:39:23,243 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 12:39:23,251 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:39:23" (1/1) ... [2018-11-18 12:39:23,251 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:39:23" (1/1) ... [2018-11-18 12:39:23,254 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:39:23" (1/1) ... [2018-11-18 12:39:23,254 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:39:23" (1/1) ... [2018-11-18 12:39:23,266 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:39:23" (1/1) ... [2018-11-18 12:39:23,274 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:39:23" (1/1) ... [2018-11-18 12:39:23,278 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:39:23" (1/1) ... [2018-11-18 12:39:23,282 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 12:39:23,283 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 12:39:23,283 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 12:39:23,283 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 12:39:23,283 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:39:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_50675c4e-831b-4689-8e41-72f63fadd5f2/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:39:23,328 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 12:39:23,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 12:39:23,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 12:39:24,072 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 12:39:24,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:39:24 BoogieIcfgContainer [2018-11-18 12:39:24,073 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 12:39:24,073 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 12:39:24,073 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 12:39:24,075 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 12:39:24,076 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:39:24,076 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 12:39:22" (1/3) ... [2018-11-18 12:39:24,077 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6878c70d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 12:39:24, skipping insertion in model container [2018-11-18 12:39:24,077 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:39:24,077 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:39:23" (2/3) ... [2018-11-18 12:39:24,077 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6878c70d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 12:39:24, skipping insertion in model container [2018-11-18 12:39:24,078 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:39:24,078 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:39:24" (3/3) ... [2018-11-18 12:39:24,079 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label00_true-unreach-call_false-termination.c [2018-11-18 12:39:24,110 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 12:39:24,110 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 12:39:24,110 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 12:39:24,111 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 12:39:24,111 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 12:39:24,111 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 12:39:24,111 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 12:39:24,111 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 12:39:24,111 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 12:39:24,124 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-18 12:39:24,146 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-18 12:39:24,146 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:39:24,146 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:39:24,152 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 12:39:24,152 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 12:39:24,152 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 12:39:24,152 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-18 12:39:24,158 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-18 12:39:24,158 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:39:24,158 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:39:24,159 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 12:39:24,159 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 12:39:24,164 INFO L794 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 167#L606-3true [2018-11-18 12:39:24,164 INFO L796 eck$LassoCheckResult]: Loop: 167#L606-3true assume true; 163#L606-1true assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 65#L611true assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 192#L30true assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 207#L597true main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 167#L606-3true [2018-11-18 12:39:24,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:39:24,169 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 12:39:24,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:39:24,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:39:24,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:39:24,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:39:24,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:39:24,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:39:24,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:39:24,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:39:24,243 INFO L82 PathProgramCache]: Analyzing trace with hash 34545679, now seen corresponding path program 1 times [2018-11-18 12:39:24,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:39:24,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:39:24,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:39:24,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:39:24,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:39:24,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:39:24,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:39:24,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:39:24,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1805985165, now seen corresponding path program 1 times [2018-11-18 12:39:24,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:39:24,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:39:24,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:39:24,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:39:24,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:39:24,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:39:24,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:39:24,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:39:24,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 12:39:24,463 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2018-11-18 12:39:24,517 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:39:24,518 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:39:24,519 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:39:24,519 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:39:24,519 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 12:39:24,519 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:39:24,519 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:39:24,519 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:39:24,520 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label00_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-18 12:39:24,520 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:39:24,520 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:39:24,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:39:24,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:39:24,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:39:24,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:39:24,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:39:24,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:39:24,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:39:24,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:39:24,827 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:39:24,827 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_50675c4e-831b-4689-8e41-72f63fadd5f2/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:39:24,831 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:39:24,831 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:39:24,836 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 12:39:24,836 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_50675c4e-831b-4689-8e41-72f63fadd5f2/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:39:24,856 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:39:24,856 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:39:24,861 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 12:39:24,861 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_50675c4e-831b-4689-8e41-72f63fadd5f2/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:39:24,893 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:39:24,893 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:39:24,914 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 12:39:24,915 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_50675c4e-831b-4689-8e41-72f63fadd5f2/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:39:24,947 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:39:24,947 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:39:24,952 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 12:39:24,952 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_50675c4e-831b-4689-8e41-72f63fadd5f2/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:39:24,983 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:39:24,983 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:39:24,986 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 12:39:24,987 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_50675c4e-831b-4689-8e41-72f63fadd5f2/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:39:25,004 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:39:25,005 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:39:25,008 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 12:39:25,008 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_50675c4e-831b-4689-8e41-72f63fadd5f2/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:39:25,027 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:39:25,027 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:39:25,034 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 12:39:25,035 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_50675c4e-831b-4689-8e41-72f63fadd5f2/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:39:25,052 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:39:25,052 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_50675c4e-831b-4689-8e41-72f63fadd5f2/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:39:25,076 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 12:39:25,076 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:39:25,106 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 12:39:25,108 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:39:25,108 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:39:25,108 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:39:25,108 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:39:25,108 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:39:25,109 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:39:25,109 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:39:25,109 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:39:25,109 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label00_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-18 12:39:25,109 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:39:25,109 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:39:25,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:39:25,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:39:25,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:39:25,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:39:25,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:39:25,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:39:25,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:39:25,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:39:25,291 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:39:25,295 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:39:25,296 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:25,297 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:39:25,299 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:39:25,299 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,307 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:25,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:39:25,309 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:39:25,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,311 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:25,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,312 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 12:39:25,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:39:25,314 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:39:25,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,334 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:25,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:39:25,336 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:39:25,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,340 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:25,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:39:25,341 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:39:25,341 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:25,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:39:25,344 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:39:25,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,347 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:25,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:39:25,348 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:39:25,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,349 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:25,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,350 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 12:39:25,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:39:25,351 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 12:39:25,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,355 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-18 12:39:25,356 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:25,356 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,357 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 12:39:25,358 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 12:39:25,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,365 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:25,366 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,366 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 12:39:25,367 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 12:39:25,367 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,370 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:25,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,371 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 12:39:25,371 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 12:39:25,373 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 12:39:25,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,389 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,389 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:25,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,390 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 12:39:25,391 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 12:39:25,391 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:25,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,396 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 12:39:25,396 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 12:39:25,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:25,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,416 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 12:39:25,416 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 12:39:25,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,418 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,418 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:25,421 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,421 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 12:39:25,422 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 12:39:25,422 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,423 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,423 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:25,423 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,424 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 12:39:25,424 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 12:39:25,424 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:39:25,425 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,429 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-18 12:39:25,430 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:25,430 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,431 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 12:39:25,432 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 12:39:25,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,438 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,438 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:25,439 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,439 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 12:39:25,440 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 12:39:25,440 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,446 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,446 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:25,447 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,447 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 12:39:25,447 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 12:39:25,449 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 12:39:25,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:25,463 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,463 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 12:39:25,464 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 12:39:25,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,468 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,468 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:25,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,470 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 12:39:25,471 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 12:39:25,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,472 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:25,473 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,473 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 12:39:25,474 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 12:39:25,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:25,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,478 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 12:39:25,478 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 12:39:25,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,479 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:25,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,480 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 12:39:25,480 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 12:39:25,481 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:39:25,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,485 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-18 12:39:25,485 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:25,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,486 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 12:39:25,487 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 12:39:25,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:25,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,494 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 12:39:25,495 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 12:39:25,495 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,497 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:25,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,498 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 12:39:25,498 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 12:39:25,500 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 12:39:25,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,512 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:25,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,513 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 12:39:25,514 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 12:39:25,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:25,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,518 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 12:39:25,518 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 12:39:25,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:25,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,521 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 12:39:25,522 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 12:39:25,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:25,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,524 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 12:39:25,525 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 12:39:25,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:25,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,526 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 12:39:25,526 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 12:39:25,527 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 12:39:25,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,531 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-18 12:39:25,532 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,532 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:25,532 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 12:39:25,532 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,533 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 12:39:25,534 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 12:39:25,534 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,547 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:25,547 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 12:39:25,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,547 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 12:39:25,548 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 12:39:25,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,553 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,554 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:25,554 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 12:39:25,554 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,554 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 12:39:25,554 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 12:39:25,556 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 12:39:25,557 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,579 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,580 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:25,580 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 12:39:25,580 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,580 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 12:39:25,581 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 12:39:25,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,584 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,584 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:25,584 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 12:39:25,584 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,585 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 12:39:25,585 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 12:39:25,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,588 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,588 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:25,588 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 12:39:25,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,589 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 12:39:25,589 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 12:39:25,589 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,591 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,592 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:25,592 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 12:39:25,592 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,592 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 12:39:25,593 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 12:39:25,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,593 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,594 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:25,594 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 12:39:25,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,594 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 12:39:25,595 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 12:39:25,595 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:39:25,595 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,600 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-18 12:39:25,600 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,600 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:25,601 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 12:39:25,601 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,601 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 12:39:25,602 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 12:39:25,602 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,613 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,614 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,614 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:25,614 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 12:39:25,614 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,615 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 12:39:25,615 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 12:39:25,615 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,618 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,619 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:25,619 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 12:39:25,619 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,619 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 12:39:25,619 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 12:39:25,622 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 12:39:25,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,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-18 12:39:25,644 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:25,645 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 12:39:25,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,645 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 12:39:25,646 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 12:39:25,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,651 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,651 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:25,651 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 12:39:25,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,652 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 12:39:25,652 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 12:39:25,652 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,655 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,655 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:25,655 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 12:39:25,656 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,656 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 12:39:25,656 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 12:39:25,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,659 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,660 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:25,660 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 12:39:25,660 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,660 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 12:39:25,661 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 12:39:25,661 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,662 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:25,662 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 12:39:25,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,663 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 12:39:25,663 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 12:39:25,664 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:39:25,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,669 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,669 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-18 12:39:25,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,670 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:25,670 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 12:39:25,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,671 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 12:39:25,673 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 12:39:25,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,680 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:25,680 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 12:39:25,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,681 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 12:39:25,681 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 12:39:25,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,685 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:25,686 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 12:39:25,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,686 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 12:39:25,686 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 12:39:25,690 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 12:39:25,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,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-18 12:39:25,717 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:25,717 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 12:39:25,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,718 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 12:39:25,719 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 12:39:25,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,724 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:25,724 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 12:39:25,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,724 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 12:39:25,725 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 12:39:25,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,729 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,729 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:25,730 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 12:39:25,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,730 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 12:39:25,731 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 12:39:25,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,735 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:25,735 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 12:39:25,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,736 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 12:39:25,736 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 12:39:25,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,738 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:25,738 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 12:39:25,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,738 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 12:39:25,738 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 12:39:25,740 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 12:39:25,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,746 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-18 12:39:25,746 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,747 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:25,747 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 12:39:25,747 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,747 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 12:39:25,748 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 12:39:25,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,755 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:25,755 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 12:39:25,755 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,755 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 12:39:25,756 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 12:39:25,756 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,758 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:25,758 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 12:39:25,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,758 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 12:39:25,758 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 12:39:25,760 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 12:39:25,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,773 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,773 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:25,773 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 12:39:25,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,774 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 12:39:25,774 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 12:39:25,774 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,779 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:25,779 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 12:39:25,779 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,779 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 12:39:25,780 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 12:39:25,780 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,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-18 12:39:25,782 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:25,782 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 12:39:25,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,782 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 12:39:25,782 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 12:39:25,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,785 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:25,785 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 12:39:25,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,785 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 12:39:25,785 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 12:39:25,786 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,787 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,787 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:25,787 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 12:39:25,787 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,788 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 12:39:25,788 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 12:39:25,788 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:39:25,788 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,794 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-18 12:39:25,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,794 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:25,794 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 12:39:25,795 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,795 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 12:39:25,796 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:39:25,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,818 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,818 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:25,818 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 12:39:25,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,819 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 12:39:25,819 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:39:25,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,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-18 12:39:25,823 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:25,823 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 12:39:25,823 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,823 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 12:39:25,823 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 12:39:25,826 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-18 12:39:25,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,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-18 12:39:25,884 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:25,885 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 12:39:25,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,885 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 12:39:25,886 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:39:25,886 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,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-18 12:39:25,894 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:25,895 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 12:39:25,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,895 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 12:39:25,895 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:39:25,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,898 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,898 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:25,898 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 12:39:25,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,899 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 12:39:25,899 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:39:25,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,902 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:25,902 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 12:39:25,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:25,903 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 12:39:25,903 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:39:25,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,905 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:25,906 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:25,906 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 12:39:25,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:25,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:25,906 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 12:39:25,906 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 12:39:25,907 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 12:39:25,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:25,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:25,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:39:25,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:39:25,924 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 3 states. [2018-11-18 12:39:26,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:39:26,421 INFO L93 Difference]: Finished difference Result 381 states and 547 transitions. [2018-11-18 12:39:26,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:39:26,423 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 381 states and 547 transitions. [2018-11-18 12:39:26,428 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 371 [2018-11-18 12:39:26,434 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 381 states to 373 states and 539 transitions. [2018-11-18 12:39:26,435 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 373 [2018-11-18 12:39:26,436 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 373 [2018-11-18 12:39:26,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 373 states and 539 transitions. [2018-11-18 12:39:26,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 12:39:26,438 INFO L705 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-18 12:39:26,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states and 539 transitions. [2018-11-18 12:39:26,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 372. [2018-11-18 12:39:26,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-11-18 12:39:26,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 537 transitions. [2018-11-18 12:39:26,468 INFO L728 BuchiCegarLoop]: Abstraction has 372 states and 537 transitions. [2018-11-18 12:39:26,468 INFO L608 BuchiCegarLoop]: Abstraction has 372 states and 537 transitions. [2018-11-18 12:39:26,468 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 12:39:26,468 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 372 states and 537 transitions. [2018-11-18 12:39:26,470 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 370 [2018-11-18 12:39:26,470 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:39:26,470 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:39:26,470 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 12:39:26,470 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:39:26,470 INFO L794 eck$LassoCheckResult]: Stem: 751#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 632#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 633#L606-3 [2018-11-18 12:39:26,471 INFO L796 eck$LassoCheckResult]: Loop: 633#L606-3 assume true; 859#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 949#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 947#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); 946#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 945#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); 944#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 943#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); 942#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 941#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; 635#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 633#L606-3 [2018-11-18 12:39:26,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:39:26,471 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-18 12:39:26,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:39:26,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:39:26,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:39:26,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:39:26,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:39:26,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:39:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:39:26,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:39:26,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1956321088, now seen corresponding path program 1 times [2018-11-18 12:39:26,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:39:26,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:39:26,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:39:26,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:39:26,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:39:26,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:39:26,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:39:26,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:39:26,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1962170302, now seen corresponding path program 1 times [2018-11-18 12:39:26,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:39:26,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:39:26,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:39:26,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:39:26,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:39:26,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:39:26,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:39:26,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:39:26,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 12:39:26,591 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:39:26,591 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:39:26,591 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:39:26,591 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:39:26,592 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 12:39:26,592 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:39:26,592 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:39:26,592 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:39:26,592 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label00_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-18 12:39:26,592 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:39:26,592 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:39:26,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:39:26,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:39:26,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:39:26,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:39:26,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:39:26,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:39:26,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:39:26,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:39:26,713 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:39:26,714 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_50675c4e-831b-4689-8e41-72f63fadd5f2/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:39:26,727 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:39:26,727 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:39:26,730 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 12:39:26,730 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_50675c4e-831b-4689-8e41-72f63fadd5f2/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:39:26,746 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:39:26,746 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:39:26,751 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 12:39:26,751 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_50675c4e-831b-4689-8e41-72f63fadd5f2/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:39:26,772 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:39:26,772 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:39:26,774 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 12:39:26,775 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_50675c4e-831b-4689-8e41-72f63fadd5f2/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:39:26,790 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:39:26,790 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:39:26,792 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 12:39:26,792 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_50675c4e-831b-4689-8e41-72f63fadd5f2/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:39:26,809 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:39:26,809 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:39:26,811 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 12:39:26,812 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_50675c4e-831b-4689-8e41-72f63fadd5f2/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:39:26,829 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:39:26,829 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_50675c4e-831b-4689-8e41-72f63fadd5f2/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:39:26,847 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 12:39:26,847 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:39:26,868 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 12:39:26,869 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:39:26,869 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:39:26,869 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:39:26,869 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:39:26,870 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:39:26,870 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:39:26,870 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:39:26,870 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:39:26,870 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label00_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-18 12:39:26,870 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:39:26,870 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:39:26,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:39:26,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:39:26,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:39:26,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-18 12:39:26,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:39:26,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:39:26,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-18 12:39:26,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:39:27,052 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:39:27,052 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:39:27,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:27,053 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:27,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:39:27,054 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:39:27,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:27,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:27,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:39:27,056 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:39:27,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:27,057 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,058 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 12:39:27,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:39:27,062 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 12:39:27,062 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:27,063 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:27,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:39:27,064 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:39:27,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,064 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:27,065 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:27,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:39:27,065 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:39:27,065 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,066 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:27,066 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,066 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 12:39:27,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:39:27,067 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 12:39:27,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,068 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:27,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,069 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 12:39:27,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:39:27,069 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 12:39:27,069 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,071 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,071 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:27,072 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:27,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:39:27,072 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:39:27,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,074 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-18 12:39:27,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:27,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:27,074 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 12:39:27,075 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 12:39:27,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,075 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,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-18 12:39:27,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:27,076 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:27,076 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 12:39:27,077 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 12:39:27,077 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,078 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:27,078 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,078 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 12:39:27,078 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 12:39:27,079 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:39:27,079 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,079 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:27,080 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:27,080 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 12:39:27,080 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 12:39:27,080 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,080 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,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-18 12:39:27,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:27,081 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:27,081 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 12:39:27,081 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 12:39:27,081 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:27,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,083 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 12:39:27,083 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 12:39:27,083 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:39:27,083 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:27,085 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,086 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 12:39:27,086 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 12:39:27,086 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:39:27,086 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,089 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:27,089 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:27,090 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 12:39:27,090 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 12:39:27,090 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,092 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-18 12:39:27,092 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:27,092 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:27,093 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 12:39:27,093 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 12:39:27,093 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:27,095 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:27,095 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 12:39:27,095 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 12:39:27,095 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,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-18 12:39:27,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:27,097 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,097 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 12:39:27,097 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 12:39:27,098 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:39:27,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,098 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:27,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:27,099 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 12:39:27,099 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 12:39:27,099 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,100 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,100 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:27,100 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:27,100 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 12:39:27,101 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 12:39:27,101 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:27,102 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,103 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 12:39:27,103 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 12:39:27,103 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:39:27,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:27,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,106 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 12:39:27,106 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 12:39:27,107 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:39:27,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,110 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:27,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:27,111 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 12:39:27,112 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 12:39:27,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,114 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-18 12:39:27,114 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:27,115 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:27,115 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 12:39:27,115 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 12:39:27,115 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:27,117 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:27,117 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 12:39:27,118 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 12:39:27,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:27,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,120 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 12:39:27,121 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 12:39:27,121 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 12:39:27,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,122 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,122 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:27,122 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:27,122 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 12:39:27,123 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 12:39:27,123 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:27,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:27,124 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 12:39:27,124 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 12:39:27,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:27,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,126 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 12:39:27,126 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 12:39:27,127 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 12:39:27,127 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,129 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:27,130 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,130 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 12:39:27,130 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 12:39:27,131 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 12:39:27,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,135 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:39:27,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:27,136 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 12:39:27,136 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 12:39:27,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,139 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,139 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-18 12:39:27,140 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,140 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:27,140 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 12:39:27,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:27,140 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 12:39:27,141 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 12:39:27,141 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,143 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,144 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:27,144 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 12:39:27,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:27,144 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 12:39:27,145 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 12:39:27,145 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,148 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:27,148 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 12:39:27,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,148 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 12:39:27,149 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 12:39:27,149 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:39:27,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,151 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:27,151 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 12:39:27,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:27,152 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 12:39:27,152 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 12:39:27,152 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,153 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:27,153 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 12:39:27,153 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:27,153 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 12:39:27,154 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 12:39:27,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,156 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:27,156 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 12:39:27,156 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,157 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 12:39:27,157 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 12:39:27,157 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:39:27,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,161 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,162 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:27,162 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 12:39:27,162 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,162 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 12:39:27,162 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 12:39:27,163 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:39:27,163 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,169 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,169 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:27,170 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 12:39:27,170 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:27,170 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 12:39:27,171 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 12:39:27,171 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,174 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-18 12:39:27,174 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,175 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:27,175 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 12:39:27,175 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:27,175 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 12:39:27,176 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 12:39:27,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,179 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:27,179 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 12:39:27,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:27,180 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 12:39:27,180 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 12:39:27,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,185 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:27,185 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 12:39:27,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,185 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 12:39:27,185 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 12:39:27,186 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:39:27,186 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,188 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:27,188 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 12:39:27,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:27,188 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 12:39:27,189 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 12:39:27,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,190 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,190 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:27,191 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 12:39:27,191 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:27,191 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 12:39:27,191 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 12:39:27,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,194 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,194 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:27,195 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 12:39:27,195 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,195 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 12:39:27,195 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 12:39:27,196 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:39:27,196 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,202 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:27,202 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 12:39:27,202 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,203 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 12:39:27,203 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 12:39:27,204 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:39:27,204 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,215 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:27,215 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 12:39:27,216 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:27,216 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 12:39:27,217 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 12:39:27,217 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,223 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-18 12:39:27,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-18 12:39:27,223 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:27,223 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 12:39:27,223 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:27,224 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 12:39:27,224 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 12:39:27,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,227 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,228 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:27,228 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 12:39:27,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:27,229 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 12:39:27,230 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 12:39:27,230 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,235 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,235 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:27,235 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 12:39:27,235 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,236 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 12:39:27,236 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 12:39:27,237 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 12:39:27,237 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,246 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,247 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:27,247 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 12:39:27,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:27,247 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 12:39:27,248 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 12:39:27,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,248 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,249 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:27,249 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 12:39:27,249 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:27,250 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 12:39:27,250 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 12:39:27,250 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,254 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:27,254 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 12:39:27,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,255 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 12:39:27,255 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 12:39:27,256 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 12:39:27,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,265 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:27,265 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 12:39:27,265 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,265 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 12:39:27,265 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 12:39:27,268 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 12:39:27,268 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,288 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,288 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:27,288 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 12:39:27,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:27,289 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 12:39:27,292 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 12:39:27,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,299 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-18 12:39:27,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,300 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:27,300 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 12:39:27,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:27,300 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 12:39:27,301 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 12:39:27,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,302 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,302 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,303 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:27,303 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 12:39:27,303 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:27,303 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 12:39:27,304 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 12:39:27,304 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,307 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,307 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:27,307 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 12:39:27,307 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,308 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 12:39:27,308 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 12:39:27,308 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:39:27,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,309 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,310 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,310 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:27,310 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 12:39:27,310 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:27,311 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 12:39:27,311 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 12:39:27,311 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,312 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,313 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:27,313 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 12:39:27,313 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:27,313 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 12:39:27,313 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 12:39:27,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,315 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:27,315 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 12:39:27,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,316 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 12:39:27,316 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 12:39:27,316 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:39:27,316 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,320 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,321 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:27,321 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 12:39:27,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,321 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 12:39:27,321 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 12:39:27,322 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:39:27,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,328 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,329 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:27,329 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 12:39:27,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:27,329 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 12:39:27,330 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 12:39:27,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,337 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-18 12:39:27,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,337 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:27,338 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 12:39:27,338 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:27,339 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 12:39:27,340 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:39:27,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,343 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:27,343 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 12:39:27,343 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:27,343 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 12:39:27,344 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:39:27,344 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,350 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,351 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,351 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:27,351 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 12:39:27,351 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,352 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 12:39:27,352 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 12:39:27,352 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 12:39:27,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,354 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:27,355 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 12:39:27,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:27,355 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 12:39:27,355 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:39:27,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,358 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:27,358 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 12:39:27,359 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:27,359 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 12:39:27,359 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:39:27,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,362 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,363 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:27,363 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 12:39:27,363 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,363 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 12:39:27,363 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 12:39:27,364 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 12:39:27,364 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,372 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,372 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:27,372 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 12:39:27,372 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,372 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 12:39:27,373 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 12:39:27,374 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 12:39:27,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,403 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:39:27,404 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 12:39:27,404 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 12:39:27,404 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:39:27,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:39:27,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:39:27,404 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 12:39:27,406 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:39:27,406 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:39:27,424 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:39:27,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:39:27,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:39:27,425 INFO L87 Difference]: Start difference. First operand 372 states and 537 transitions. cyclomatic complexity: 166 Second operand 3 states. [2018-11-18 12:39:27,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:39:27,826 INFO L93 Difference]: Finished difference Result 659 states and 915 transitions. [2018-11-18 12:39:27,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:39:27,827 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 659 states and 915 transitions. [2018-11-18 12:39:27,831 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 657 [2018-11-18 12:39:27,835 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 659 states to 659 states and 915 transitions. [2018-11-18 12:39:27,835 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 659 [2018-11-18 12:39:27,836 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 659 [2018-11-18 12:39:27,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 659 states and 915 transitions. [2018-11-18 12:39:27,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 12:39:27,838 INFO L705 BuchiCegarLoop]: Abstraction has 659 states and 915 transitions. [2018-11-18 12:39:27,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states and 915 transitions. [2018-11-18 12:39:27,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2018-11-18 12:39:27,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2018-11-18 12:39:27,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 915 transitions. [2018-11-18 12:39:27,854 INFO L728 BuchiCegarLoop]: Abstraction has 659 states and 915 transitions. [2018-11-18 12:39:27,854 INFO L608 BuchiCegarLoop]: Abstraction has 659 states and 915 transitions. [2018-11-18 12:39:27,854 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 12:39:27,854 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 659 states and 915 transitions. [2018-11-18 12:39:27,857 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 657 [2018-11-18 12:39:27,857 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:39:27,857 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:39:27,858 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 12:39:27,858 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:39:27,858 INFO L794 eck$LassoCheckResult]: Stem: 1795#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 1671#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 1672#L606-3 [2018-11-18 12:39:27,859 INFO L796 eck$LassoCheckResult]: Loop: 1672#L606-3 assume true; 1902#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1773#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 1774#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); 1919#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; 1683#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 2183#L606-3 assume true; 2181#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 2179#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 2177#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); 2175#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 2173#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); 2171#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 2169#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); 2167#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 2165#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)); 2163#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); 2161#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); 2159#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); 2157#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 2155#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); 2153#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 2151#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 2149#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 2146#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); 2144#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); 2142#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 2140#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); 2138#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 2136#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 2134#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); 2132#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 2130#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); 2128#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); 2126#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 2124#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 2122#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 2120#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 2118#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); 2116#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 2114#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 2112#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 2110#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); 2108#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 2106#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 2104#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); 2102#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 2100#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); 2098#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); 2096#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 2094#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); 2092#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 2090#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 2088#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; 1781#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1672#L606-3 [2018-11-18 12:39:27,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:39:27,860 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-18 12:39:27,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:39:27,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:39:27,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:39:27,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:39:27,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:39:27,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:39:27,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:39:27,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:39:27,865 INFO L82 PathProgramCache]: Analyzing trace with hash 692590236, now seen corresponding path program 1 times [2018-11-18 12:39:27,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:39:27,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:39:27,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:39:27,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:39:27,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:39:27,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:39:27,930 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:39:27,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:39:27,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:39:27,930 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 12:39:27,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:39:27,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:39:27,931 INFO L87 Difference]: Start difference. First operand 659 states and 915 transitions. cyclomatic complexity: 257 Second operand 4 states. [2018-11-18 12:39:28,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:39:28,616 INFO L93 Difference]: Finished difference Result 1227 states and 1696 transitions. [2018-11-18 12:39:28,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 12:39:28,617 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1227 states and 1696 transitions. [2018-11-18 12:39:28,623 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1223 [2018-11-18 12:39:28,629 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1227 states to 1227 states and 1696 transitions. [2018-11-18 12:39:28,629 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1227 [2018-11-18 12:39:28,630 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1227 [2018-11-18 12:39:28,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1227 states and 1696 transitions. [2018-11-18 12:39:28,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 12:39:28,632 INFO L705 BuchiCegarLoop]: Abstraction has 1227 states and 1696 transitions. [2018-11-18 12:39:28,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states and 1696 transitions. [2018-11-18 12:39:28,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1224. [2018-11-18 12:39:28,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1224 states. [2018-11-18 12:39:28,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1690 transitions. [2018-11-18 12:39:28,694 INFO L728 BuchiCegarLoop]: Abstraction has 1224 states and 1690 transitions. [2018-11-18 12:39:28,694 INFO L608 BuchiCegarLoop]: Abstraction has 1224 states and 1690 transitions. [2018-11-18 12:39:28,694 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 12:39:28,697 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1224 states and 1690 transitions. [2018-11-18 12:39:28,700 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1220 [2018-11-18 12:39:28,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:39:28,700 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:39:28,704 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 12:39:28,704 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:39:28,704 INFO L794 eck$LassoCheckResult]: Stem: 3691#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 3563#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 3564#L606-3 [2018-11-18 12:39:28,705 INFO L796 eck$LassoCheckResult]: Loop: 3564#L606-3 assume true; 4585#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4581#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 4577#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); 4574#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 4570#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); 4569#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 4568#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); 4329#L50 assume 1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0;~a28~0 := 11;~a25~0 := 1;calculate_output_#res := 26; 3750#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4310#L606-3 assume true; 4308#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4306#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 4304#L30 assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 3712#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4553#L606-3 assume true; 4193#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4182#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 4181#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); 4179#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 4177#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); 4175#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 4173#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); 4171#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 4169#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)); 4167#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); 4165#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); 4163#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); 4161#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 4159#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); 4157#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 4155#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 4153#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 4151#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); 4149#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); 4147#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 4145#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); 4143#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 4141#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 4139#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); 4137#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 4135#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); 4133#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); 4131#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 4129#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 4127#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 4125#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 4123#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); 4121#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 4119#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 4117#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 4115#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); 4113#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 4111#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 4109#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); 4107#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 4105#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); 4103#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); 4101#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 4099#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); 4097#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 4095#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 4093#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)); 4091#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); 4088#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; 4089#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3564#L606-3 [2018-11-18 12:39:28,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:39:28,705 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-18 12:39:28,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:39:28,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:39:28,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:39:28,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:39:28,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:39:28,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:39:28,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:39:28,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:39:28,709 INFO L82 PathProgramCache]: Analyzing trace with hash 676565178, now seen corresponding path program 1 times [2018-11-18 12:39:28,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:39:28,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:39:28,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:39:28,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:39:28,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:39:28,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:39:28,754 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 12:39:28,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:39:28,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:39:28,754 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 12:39:28,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:39:28,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:39:28,755 INFO L87 Difference]: Start difference. First operand 1224 states and 1690 transitions. cyclomatic complexity: 468 Second operand 3 states. [2018-11-18 12:39:29,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:39:29,116 INFO L93 Difference]: Finished difference Result 1508 states and 1999 transitions. [2018-11-18 12:39:29,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:39:29,117 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1508 states and 1999 transitions. [2018-11-18 12:39:29,124 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-18 12:39:29,129 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1508 states to 1508 states and 1999 transitions. [2018-11-18 12:39:29,129 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1508 [2018-11-18 12:39:29,130 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1508 [2018-11-18 12:39:29,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1508 states and 1999 transitions. [2018-11-18 12:39:29,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 12:39:29,132 INFO L705 BuchiCegarLoop]: Abstraction has 1508 states and 1999 transitions. [2018-11-18 12:39:29,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states and 1999 transitions. [2018-11-18 12:39:29,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1507. [2018-11-18 12:39:29,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2018-11-18 12:39:29,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1997 transitions. [2018-11-18 12:39:29,150 INFO L728 BuchiCegarLoop]: Abstraction has 1507 states and 1997 transitions. [2018-11-18 12:39:29,150 INFO L608 BuchiCegarLoop]: Abstraction has 1507 states and 1997 transitions. [2018-11-18 12:39:29,150 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 12:39:29,151 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1507 states and 1997 transitions. [2018-11-18 12:39:29,155 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1503 [2018-11-18 12:39:29,155 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:39:29,155 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:39:29,157 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 12:39:29,157 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:39:29,157 INFO L794 eck$LassoCheckResult]: Stem: 6428#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 6301#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 6302#L606-3 [2018-11-18 12:39:29,157 INFO L796 eck$LassoCheckResult]: Loop: 6302#L606-3 assume true; 7538#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7536#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 7534#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); 7532#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 7530#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); 7528#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 7526#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); 7523#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 7524#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)); 7520#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); 6305#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); 6306#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); 6558#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 6446#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); 6447#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 6503#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 6429#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 6430#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; 6536#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6919#L606-3 assume true; 6917#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6915#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6913#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; 6449#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6921#L606-3 assume true; 6920#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6918#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6916#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); 6914#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 6912#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); 6910#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6908#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); 6906#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 6904#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)); 6902#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); 6900#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); 6898#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); 6896#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 6894#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); 6892#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 6890#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 6888#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 6886#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); 6884#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); 6882#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 6880#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); 6878#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 6876#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 6874#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); 6872#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 6870#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); 6868#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); 6866#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 6864#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 6862#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 6860#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 6858#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); 6856#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 6854#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6852#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 6850#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); 6848#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 6846#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 6844#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); 6842#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6840#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); 6838#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); 6836#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 6834#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); 6832#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 6830#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 6828#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)); 6826#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); 6822#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; 6823#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6302#L606-3 [2018-11-18 12:39:29,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:39:29,157 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-18 12:39:29,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:39:29,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:39:29,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:39:29,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:39:29,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:39:29,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:39:29,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:39:29,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:39:29,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1219893882, now seen corresponding path program 1 times [2018-11-18 12:39:29,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:39:29,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:39:29,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:39:29,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:39:29,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:39:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:39:29,205 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 12:39:29,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:39:29,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:39:29,205 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 12:39:29,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:39:29,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:39:29,206 INFO L87 Difference]: Start difference. First operand 1507 states and 1997 transitions. cyclomatic complexity: 492 Second operand 3 states. [2018-11-18 12:39:29,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:39:29,596 INFO L93 Difference]: Finished difference Result 1506 states and 1820 transitions. [2018-11-18 12:39:29,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:39:29,596 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1506 states and 1820 transitions. [2018-11-18 12:39:29,599 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1503 [2018-11-18 12:39:29,602 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1506 states to 1506 states and 1820 transitions. [2018-11-18 12:39:29,602 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1506 [2018-11-18 12:39:29,603 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1506 [2018-11-18 12:39:29,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1506 states and 1820 transitions. [2018-11-18 12:39:29,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 12:39:29,605 INFO L705 BuchiCegarLoop]: Abstraction has 1506 states and 1820 transitions. [2018-11-18 12:39:29,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states and 1820 transitions. [2018-11-18 12:39:29,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506. [2018-11-18 12:39:29,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1506 states. [2018-11-18 12:39:29,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 1820 transitions. [2018-11-18 12:39:29,616 INFO L728 BuchiCegarLoop]: Abstraction has 1506 states and 1820 transitions. [2018-11-18 12:39:29,616 INFO L608 BuchiCegarLoop]: Abstraction has 1506 states and 1820 transitions. [2018-11-18 12:39:29,616 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 12:39:29,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1506 states and 1820 transitions. [2018-11-18 12:39:29,620 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1503 [2018-11-18 12:39:29,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:39:29,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:39:29,621 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 12:39:29,621 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:39:29,621 INFO L794 eck$LassoCheckResult]: Stem: 9445#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 9320#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 9321#L606-3 [2018-11-18 12:39:29,621 INFO L796 eck$LassoCheckResult]: Loop: 9321#L606-3 assume true; 10113#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 10111#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 10109#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 10108#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 10106#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); 10105#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 10104#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); 10094#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 10095#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)); 10088#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); 10089#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); 10522#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); 10518#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 10514#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); 10510#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 10506#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 10500#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 9881#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); 9882#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); 10044#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 10042#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); 10040#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 10038#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 10036#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); 10034#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10032#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); 10030#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); 10028#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 9774#L165 assume (1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0);~a25~0 := 1;~a28~0 := 9;calculate_output_#res := 26; 9665#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9767#L606-3 assume true; 9765#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 9763#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 9761#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 9759#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 9757#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 9755#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 9753#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 9751#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 9749#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 9747#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 9745#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 9743#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 9741#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 9739#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 9737#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 9735#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 9733#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 9731#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 9729#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 9727#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 9725#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 9723#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 9721#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 9719#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 9717#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 9715#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 9713#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 9710#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 9708#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 9706#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 9704#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 9702#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 9700#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 9698#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 9696#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 9694#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 9692#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 9690#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 9688#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 9686#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 9684#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 9682#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 9680#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 9678#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 9676#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 9674#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 9672#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 9670#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 9667#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 9668#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9321#L606-3 [2018-11-18 12:39:29,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:39:29,622 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-18 12:39:29,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:39:29,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:39:29,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:39:29,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:39:29,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:39:29,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:39:29,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:39:29,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:39:29,630 INFO L82 PathProgramCache]: Analyzing trace with hash -606648447, now seen corresponding path program 1 times [2018-11-18 12:39:29,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:39:29,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:39:29,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:39:29,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:39:29,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:39:29,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:39:29,676 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:39:29,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:39:29,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:39:29,676 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 12:39:29,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:39:29,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:39:29,677 INFO L87 Difference]: Start difference. First operand 1506 states and 1820 transitions. cyclomatic complexity: 316 Second operand 3 states. [2018-11-18 12:39:29,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:39:29,862 INFO L93 Difference]: Finished difference Result 1495 states and 1776 transitions. [2018-11-18 12:39:29,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:39:29,863 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1495 states and 1776 transitions. [2018-11-18 12:39:29,867 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1492 [2018-11-18 12:39:29,870 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1495 states to 1495 states and 1776 transitions. [2018-11-18 12:39:29,870 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1495 [2018-11-18 12:39:29,871 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1495 [2018-11-18 12:39:29,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1495 states and 1776 transitions. [2018-11-18 12:39:29,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 12:39:29,872 INFO L705 BuchiCegarLoop]: Abstraction has 1495 states and 1776 transitions. [2018-11-18 12:39:29,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states and 1776 transitions. [2018-11-18 12:39:29,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1495. [2018-11-18 12:39:29,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1495 states. [2018-11-18 12:39:29,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1495 states and 1776 transitions. [2018-11-18 12:39:29,883 INFO L728 BuchiCegarLoop]: Abstraction has 1495 states and 1776 transitions. [2018-11-18 12:39:29,883 INFO L608 BuchiCegarLoop]: Abstraction has 1495 states and 1776 transitions. [2018-11-18 12:39:29,883 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 12:39:29,883 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1495 states and 1776 transitions. [2018-11-18 12:39:29,887 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1492 [2018-11-18 12:39:29,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:39:29,887 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:39:29,887 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 12:39:29,888 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:39:29,888 INFO L794 eck$LassoCheckResult]: Stem: 12449#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 12327#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 12328#L606-3 [2018-11-18 12:39:29,889 INFO L796 eck$LassoCheckResult]: Loop: 12328#L606-3 assume true; 13152#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 13150#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 13148#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); 13146#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 13144#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); 13142#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 13140#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); 13138#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 13136#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)); 13134#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); 13132#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); 13130#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); 13128#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 13126#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); 13125#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 13123#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 13121#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 13119#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); 13117#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); 13115#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 13113#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); 13111#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 13109#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 13107#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); 13105#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13103#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); 13101#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); 13100#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 12851#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 12852#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 13082#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 13081#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); 13079#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 13077#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 13075#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 13073#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); 13071#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 13069#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 13067#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); 13065#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 13063#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); 13061#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); 13059#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 13057#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); 13055#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 13053#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 13051#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)); 13049#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); 13047#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); 13045#L259 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && (((9 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)); 13043#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); 13041#L276 assume !(7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 1 == ~a21~0 && 1 == ~a19~0 && 5 == calculate_output_~input && !(1 == ~a11~0)); 13039#L280 assume !(8 == ~a28~0 && 1 == ~a21~0 && (!(1 == ~a11~0) && (1 == calculate_output_~input && 8 == ~a17~0) && 1 == ~a19~0) && 1 == ~a25~0); 13037#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); 13035#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); 13033#L291 assume !(8 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a11~0) && 1 == ~a25~0 && 8 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a19~0); 13031#L293 assume !((1 == ~a19~0 && 8 == ~a17~0 && ((!(1 == ~a25~0) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a11~0)) && 11 == ~a28~0); 13029#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); 13027#L309 assume !((((((3 == calculate_output_~input && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)) && 11 == ~a28~0) && !(1 == ~a11~0)); 13025#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); 13023#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); 13021#L331 assume !((!(1 == ~a11~0) && (((4 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0) && 11 == ~a28~0) && 1 == ~a19~0); 13019#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)); 13017#L349 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && ((1 == ~a25~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 11 == ~a28~0) && 1 == ~a21~0); 13015#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); 13013#L361 assume !(1 == ~a19~0 && ((1 == ~a21~0 && (!(1 == ~a25~0) && 3 == calculate_output_~input) && 9 == ~a17~0) && 8 == ~a28~0) && 1 == ~a11~0); 13011#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)); 13009#L375 assume !(1 == ~a19~0 && (((8 == ~a17~0 && 5 == calculate_output_~input && !(1 == ~a11~0)) && 1 == ~a21~0) && 1 == ~a25~0) && 8 == ~a28~0); 13007#L378 assume !(((!(1 == ~a11~0) && ((1 == ~a21~0 && 4 == calculate_output_~input) && 10 == ~a28~0) && 8 == ~a17~0) && !(1 == ~a19~0)) && 1 == ~a25~0); 13005#L380 assume !(8 == ~a28~0 && (1 == ~a19~0 && 1 == ~a11~0 && !(1 == ~a25~0) && 9 == ~a17~0 && 6 == calculate_output_~input) && 1 == ~a21~0); 13003#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)); 13001#L394 assume !(((((!(1 == ~a25~0) && 1 == ~a19~0 && 3 == calculate_output_~input) && 9 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 12999#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)); 12997#L402 assume !(((!(1 == ~a11~0) && ((1 == ~a19~0 && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)); 12995#L404 assume !((1 == ~a11~0 && 1 == ~a19~0 && 1 == ~a21~0 && (9 == ~a17~0 && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 8 == ~a28~0); 12993#L407 assume !(!(1 == ~a11~0) && 1 == ~a21~0 && (1 == ~a19~0 && 8 == ~a17~0 && 1 == ~a25~0 && 5 == calculate_output_~input) && 11 == ~a28~0); 12991#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); 12989#L414 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12987#L414-2 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12985#L417-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12983#L420-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12981#L423-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12979#L426-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12977#L429-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12975#L432-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12973#L435-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12344#L438-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13258#L441-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13256#L444-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13254#L447-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13252#L450-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13250#L453-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13248#L456-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13246#L459-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13244#L462-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13242#L465-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12541#L468-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13239#L471-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13237#L474-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13235#L477-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13233#L480-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13231#L483-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13229#L486-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13227#L489-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13225#L492-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13223#L495-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13221#L498-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13219#L501-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13217#L504-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13215#L507-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13213#L510-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13211#L513-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13209#L516-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13207#L519-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13205#L522-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13203#L525-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13201#L528-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13199#L531-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13197#L534-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13195#L537-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13193#L540-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13191#L543-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13189#L546-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13187#L549-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13185#L552-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13183#L555-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13181#L558-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13179#L561-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13177#L564-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13175#L567-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13173#L570-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13171#L573-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13169#L576-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13167#L579-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13165#L582-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13163#L585-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13161#L588-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13159#L591-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13157#L594-1 calculate_output_#res := -2; 13155#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 12328#L606-3 [2018-11-18 12:39:29,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:39:29,889 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-18 12:39:29,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:39:29,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:39:29,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:39:29,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:39:29,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:39:29,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:39:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:39:29,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:39:29,893 INFO L82 PathProgramCache]: Analyzing trace with hash 245249823, now seen corresponding path program 1 times [2018-11-18 12:39:29,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:39:29,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:39:29,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:39:29,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:39:29,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:39:29,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:39:29,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:39:29,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:39:29,929 INFO L82 PathProgramCache]: Analyzing trace with hash -2003304803, now seen corresponding path program 1 times [2018-11-18 12:39:29,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:39:29,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:39:29,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:39:29,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:39:29,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:39:29,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:39:30,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:39:30,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:39:30,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 12:39:31,037 WARN L180 SmtUtils]: Spent 767.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2018-11-18 12:39:31,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 12:39:31,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-18 12:39:31,104 INFO L87 Difference]: Start difference. First operand 1495 states and 1776 transitions. cyclomatic complexity: 284 Second operand 10 states. [2018-11-18 12:39:32,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:39:32,041 INFO L93 Difference]: Finished difference Result 1688 states and 1967 transitions. [2018-11-18 12:39:32,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 12:39:32,041 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1688 states and 1967 transitions. [2018-11-18 12:39:32,046 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1632 [2018-11-18 12:39:32,053 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1688 states to 1688 states and 1967 transitions. [2018-11-18 12:39:32,053 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1688 [2018-11-18 12:39:32,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1688 [2018-11-18 12:39:32,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1688 states and 1967 transitions. [2018-11-18 12:39:32,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 12:39:32,057 INFO L705 BuchiCegarLoop]: Abstraction has 1688 states and 1967 transitions. [2018-11-18 12:39:32,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states and 1967 transitions. [2018-11-18 12:39:32,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1546. [2018-11-18 12:39:32,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2018-11-18 12:39:32,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 1825 transitions. [2018-11-18 12:39:32,093 INFO L728 BuchiCegarLoop]: Abstraction has 1546 states and 1825 transitions. [2018-11-18 12:39:32,093 INFO L608 BuchiCegarLoop]: Abstraction has 1546 states and 1825 transitions. [2018-11-18 12:39:32,093 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 12:39:32,094 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1546 states and 1825 transitions. [2018-11-18 12:39:32,098 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1490 [2018-11-18 12:39:32,098 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:39:32,098 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:39:32,098 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:39:32,098 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:39:32,099 INFO L794 eck$LassoCheckResult]: Stem: 15654#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 15535#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 15536#L606-3 assume true; 16357#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16355#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 16353#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); 16351#L35 assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res := 22; 15805#L597 [2018-11-18 12:39:32,099 INFO L796 eck$LassoCheckResult]: Loop: 15805#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 16280#L606-3 assume true; 16278#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16276#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 16274#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); 16272#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 16270#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); 16268#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 16266#L47 assume ((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0;~a25~0 := 0;calculate_output_#res := -1; 15805#L597 [2018-11-18 12:39:32,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:39:32,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1805984299, now seen corresponding path program 1 times [2018-11-18 12:39:32,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:39:32,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:39:32,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:39:32,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:39:32,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:39:32,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:39:32,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:39:32,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:39:32,106 INFO L82 PathProgramCache]: Analyzing trace with hash -278812021, now seen corresponding path program 1 times [2018-11-18 12:39:32,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:39:32,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:39:32,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:39:32,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:39:32,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:39:32,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:39:32,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:39:32,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:39:32,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1569761375, now seen corresponding path program 1 times [2018-11-18 12:39:32,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:39:32,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:39:32,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:39:32,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:39:32,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:39:32,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:39:32,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:39:32,308 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:39:32,308 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:39:32,308 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:39:32,308 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:39:32,308 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 12:39:32,308 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:39:32,308 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:39:32,308 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:39:32,309 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label00_true-unreach-call_false-termination.c_Iteration8_Lasso [2018-11-18 12:39:32,309 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:39:32,309 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:39:32,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:39:32,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:39:32,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:39:32,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:39:32,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:39:32,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:39:32,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:39:32,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:39:32,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:39:32,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:39:32,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:39:32,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:39:32,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:39:32,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:39:32,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:39:32,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:39:32,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:39:32,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:39:32,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:39:32,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:39:32,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:39:32,494 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:39:32,494 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_50675c4e-831b-4689-8e41-72f63fadd5f2/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:39:32,498 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:39:32,498 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:39:32,500 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 12:39:32,500 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_50675c4e-831b-4689-8e41-72f63fadd5f2/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:39:32,516 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:39:32,516 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:39:32,518 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 12:39:32,518 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_50675c4e-831b-4689-8e41-72f63fadd5f2/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:39:32,533 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:39:32,533 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:39:32,535 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 12:39:32,535 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_50675c4e-831b-4689-8e41-72f63fadd5f2/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:39:32,550 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:39:32,550 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:39:32,553 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 12:39:32,553 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_50675c4e-831b-4689-8e41-72f63fadd5f2/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:39:32,570 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:39:32,570 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:39:32,572 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 12:39:32,572 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_50675c4e-831b-4689-8e41-72f63fadd5f2/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:39:32,587 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:39:32,587 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:39:32,589 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 12:39:32,589 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_50675c4e-831b-4689-8e41-72f63fadd5f2/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:39:32,603 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:39:32,604 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:39:32,605 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 12:39:32,605 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_50675c4e-831b-4689-8e41-72f63fadd5f2/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:39:32,621 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:39:32,621 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:39:32,626 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 12:39:32,626 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_50675c4e-831b-4689-8e41-72f63fadd5f2/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:39:32,643 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:39:32,643 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:39:32,645 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 12:39:32,645 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_50675c4e-831b-4689-8e41-72f63fadd5f2/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:39:32,660 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:39:32,660 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:39:32,662 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 12:39:32,662 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_50675c4e-831b-4689-8e41-72f63fadd5f2/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:39:32,677 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:39:32,677 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:39:32,679 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 12:39:32,679 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_50675c4e-831b-4689-8e41-72f63fadd5f2/bin-2019/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:39:32,695 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:39:32,695 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:39:32,697 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 12:39:32,697 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_50675c4e-831b-4689-8e41-72f63fadd5f2/bin-2019/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:39:32,712 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:39:32,712 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:39:32,715 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 12:39:32,715 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_50675c4e-831b-4689-8e41-72f63fadd5f2/bin-2019/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:39:32,730 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:39:32,730 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:39:32,732 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 12:39:32,732 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_50675c4e-831b-4689-8e41-72f63fadd5f2/bin-2019/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:39:32,747 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:39:32,747 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:39:32,749 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 12:39:32,749 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_50675c4e-831b-4689-8e41-72f63fadd5f2/bin-2019/uautomizer/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:39:32,764 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:39:32,764 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_50675c4e-831b-4689-8e41-72f63fadd5f2/bin-2019/uautomizer/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:39:32,783 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 12:39:32,783 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:39:32,931 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 12:39:32,931 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_50675c4e-831b-4689-8e41-72f63fadd5f2/bin-2019/uautomizer/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:39:32,947 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:39:32,947 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:39:32,949 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 12:39:32,949 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_50675c4e-831b-4689-8e41-72f63fadd5f2/bin-2019/uautomizer/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:39:32,966 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:39:32,967 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_50675c4e-831b-4689-8e41-72f63fadd5f2/bin-2019/uautomizer/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:39:32,984 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 12:39:32,984 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:39:33,117 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 12:39:33,117 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_50675c4e-831b-4689-8e41-72f63fadd5f2/bin-2019/uautomizer/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:39:33,132 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:39:33,132 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:39:33,134 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 12:39:33,135 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_50675c4e-831b-4689-8e41-72f63fadd5f2/bin-2019/uautomizer/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:39:33,150 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:39:33,150 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:39:33,152 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 12:39:33,152 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_50675c4e-831b-4689-8e41-72f63fadd5f2/bin-2019/uautomizer/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:39:33,167 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:39:33,167 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:39:33,169 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 12:39:33,169 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a28~0=0} Honda state: {~a28~0=10} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2018-11-18 12:39:33,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 12:39:33 BoogieIcfgContainer [2018-11-18 12:39:33,202 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 12:39:33,202 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 12:39:33,203 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 12:39:33,203 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 12:39:33,203 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:39:24" (3/4) ... [2018-11-18 12:39:33,205 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-18 12:39:33,237 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_50675c4e-831b-4689-8e41-72f63fadd5f2/bin-2019/uautomizer/witness.graphml [2018-11-18 12:39:33,237 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 12:39:33,238 INFO L168 Benchmark]: Toolchain (without parser) took 10438.19 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 487.1 MB). Free memory was 951.8 MB in the beginning and 1.0 GB in the end (delta: -83.2 MB). Peak memory consumption was 403.8 MB. Max. memory is 11.5 GB. [2018-11-18 12:39:33,239 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:39:33,239 INFO L168 Benchmark]: CACSL2BoogieTranslator took 339.33 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 922.2 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-11-18 12:39:33,239 INFO L168 Benchmark]: Boogie Procedure Inliner took 101.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 922.2 MB in the beginning and 1.1 GB in the end (delta: -226.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2018-11-18 12:39:33,240 INFO L168 Benchmark]: Boogie Preprocessor took 39.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-18 12:39:33,240 INFO L168 Benchmark]: RCFGBuilder took 790.12 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: 110.2 MB). Peak memory consumption was 110.2 MB. Max. memory is 11.5 GB. [2018-11-18 12:39:33,240 INFO L168 Benchmark]: BuchiAutomizer took 9129.10 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 328.2 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -279.4 kB). Peak memory consumption was 327.9 MB. Max. memory is 11.5 GB. [2018-11-18 12:39:33,240 INFO L168 Benchmark]: Witness Printer took 35.01 ms. Allocated memory is still 1.5 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:39:33,242 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 339.33 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 922.2 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 101.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 922.2 MB in the beginning and 1.1 GB in the end (delta: -226.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 790.12 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: 110.2 MB). Peak memory consumption was 110.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9129.10 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 328.2 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -279.4 kB). Peak memory consumption was 327.9 MB. Max. memory is 11.5 GB. * Witness Printer took 35.01 ms. Allocated memory is still 1.5 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (7 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.7 modules have a trivial ranking function, the largest among these consists of 10 locations. The remainder module has 1546 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.0s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 5.2s. Construction of modules took 2.5s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 147 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 1546 states and ocurred in iteration 7. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1469 SDtfs, 2286 SDslu, 560 SDs, 0 SdLazy, 3963 SolverSat, 837 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s 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: 61ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 0 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 31 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - GeometricNonTerminationArgumentResult [Line: 614]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {a19=0, a17=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@503642eb=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7720fbe1=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@503642eb=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7720fbe1=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@503642eb=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@7720fbe1=1 + sum_{k=0}^i 0, y=25 + sum_{k=0}^i 0, x=24 + sum_{k=0}^i 0, z=26 + sum_{k=0}^i 0, u=21 + sum_{k=0}^i 0, w=23 + sum_{k=0}^i 0, v=22 + sum_{k=0}^i 0, a=1 + sum_{k=0}^i 0, c=3 + sum_{k=0}^i 0, a28=10 + sum_{k=0}^i 0, \old(input)=6 + sum_{k=0}^i -6*0^k + 1*0^k, output=-1 + sum_{k=0}^i 22*0^k + -23*0^k + -23*k*0^(k-1) + 24*0^k, a25=0 + sum_{k=0}^i 0, a21=1 + sum_{k=0}^i 0, d=4 + sum_{k=0}^i 0, e=5 + sum_{k=0}^i 0, f=6 + sum_{k=0}^i 0, input=6 + sum_{k=0}^i 3*0^k + -8*0^k, input=6 + sum_{k=0}^i 2*0^k + -7*0^k} - StatisticsResult: NonterminationArgumentStatistics Unbounded Execution 5GEVs Lambdas: [0, 11, 0, 0, 0, 0] Mus: [0, 0, 0, 1, 0] - NonterminatingLassoResult [Line: 29]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND TRUE ((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1))) [L36] a28 = 10 [L37] return 22; Loop: [L614] RET, EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND TRUE ((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10)) [L48] a25 = 0 [L49] return -1; End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...