./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label26_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_fccea397-e2f3-4697-ad4f-c02716ab6be5/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fccea397-e2f3-4697-ad4f-c02716ab6be5/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fccea397-e2f3-4697-ad4f-c02716ab6be5/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fccea397-e2f3-4697-ad4f-c02716ab6be5/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label26_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_fccea397-e2f3-4697-ad4f-c02716ab6be5/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fccea397-e2f3-4697-ad4f-c02716ab6be5/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 ec64944e15cde20ad15af2bd0f0e78efc8184588 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 14:26:51,980 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 14:26:51,982 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 14:26:51,989 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 14:26:51,989 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 14:26:51,990 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 14:26:51,991 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 14:26:51,992 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 14:26:51,994 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 14:26:51,994 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 14:26:51,995 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 14:26:51,995 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 14:26:51,996 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 14:26:51,997 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 14:26:51,998 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 14:26:51,998 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 14:26:51,999 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 14:26:52,000 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 14:26:52,002 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 14:26:52,003 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 14:26:52,004 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 14:26:52,005 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 14:26:52,007 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 14:26:52,007 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 14:26:52,007 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 14:26:52,008 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 14:26:52,009 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 14:26:52,009 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 14:26:52,010 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 14:26:52,011 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 14:26:52,011 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 14:26:52,012 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 14:26:52,012 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 14:26:52,012 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 14:26:52,013 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 14:26:52,014 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 14:26:52,014 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fccea397-e2f3-4697-ad4f-c02716ab6be5/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 14:26:52,026 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 14:26:52,026 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 14:26:52,027 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 14:26:52,027 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 14:26:52,027 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 14:26:52,028 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 14:26:52,028 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 14:26:52,028 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 14:26:52,028 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 14:26:52,028 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 14:26:52,028 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 14:26:52,028 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 14:26:52,028 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 14:26:52,029 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 14:26:52,029 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 14:26:52,029 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 14:26:52,029 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 14:26:52,029 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 14:26:52,031 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 14:26:52,031 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 14:26:52,031 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 14:26:52,031 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 14:26:52,031 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 14:26:52,031 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 14:26:52,032 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 14:26:52,032 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 14:26:52,032 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 14:26:52,032 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 14:26:52,032 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 14:26:52,032 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 14:26:52,032 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 14:26:52,033 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 14:26:52,033 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_fccea397-e2f3-4697-ad4f-c02716ab6be5/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 -> ec64944e15cde20ad15af2bd0f0e78efc8184588 [2018-11-18 14:26:52,061 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 14:26:52,070 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 14:26:52,073 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 14:26:52,074 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 14:26:52,074 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 14:26:52,075 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fccea397-e2f3-4697-ad4f-c02716ab6be5/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label26_true-unreach-call_false-termination.c [2018-11-18 14:26:52,118 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fccea397-e2f3-4697-ad4f-c02716ab6be5/bin-2019/uautomizer/data/0bbb7c6c0/6cc74e48b10f46e3b52b557e7adc42da/FLAGa13e53182 [2018-11-18 14:26:52,544 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 14:26:52,549 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fccea397-e2f3-4697-ad4f-c02716ab6be5/sv-benchmarks/c/eca-rers2012/Problem02_label26_true-unreach-call_false-termination.c [2018-11-18 14:26:52,564 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fccea397-e2f3-4697-ad4f-c02716ab6be5/bin-2019/uautomizer/data/0bbb7c6c0/6cc74e48b10f46e3b52b557e7adc42da/FLAGa13e53182 [2018-11-18 14:26:52,590 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fccea397-e2f3-4697-ad4f-c02716ab6be5/bin-2019/uautomizer/data/0bbb7c6c0/6cc74e48b10f46e3b52b557e7adc42da [2018-11-18 14:26:52,593 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 14:26:52,594 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 14:26:52,594 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 14:26:52,594 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 14:26:52,598 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 14:26:52,599 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:26:52" (1/1) ... [2018-11-18 14:26:52,601 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6654e84b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:26:52, skipping insertion in model container [2018-11-18 14:26:52,601 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:26:52" (1/1) ... [2018-11-18 14:26:52,611 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 14:26:52,669 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 14:26:52,954 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:26:52,959 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 14:26:53,118 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:26:53,136 INFO L195 MainTranslator]: Completed translation [2018-11-18 14:26:53,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:26:53 WrapperNode [2018-11-18 14:26:53,137 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 14:26:53,142 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 14:26:53,142 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 14:26:53,142 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 14:26:53,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:26:53" (1/1) ... [2018-11-18 14:26:53,272 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:26:53" (1/1) ... [2018-11-18 14:26:53,334 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 14:26:53,336 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 14:26:53,336 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 14:26:53,336 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 14:26:53,344 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:26:53" (1/1) ... [2018-11-18 14:26:53,344 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:26:53" (1/1) ... [2018-11-18 14:26:53,347 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:26:53" (1/1) ... [2018-11-18 14:26:53,361 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:26:53" (1/1) ... [2018-11-18 14:26:53,390 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:26:53" (1/1) ... [2018-11-18 14:26:53,401 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:26:53" (1/1) ... [2018-11-18 14:26:53,408 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:26:53" (1/1) ... [2018-11-18 14:26:53,416 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 14:26:53,417 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 14:26:53,417 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 14:26:53,417 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 14:26:53,418 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:26:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fccea397-e2f3-4697-ad4f-c02716ab6be5/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 14:26:53,515 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 14:26:53,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 14:26:53,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 14:26:55,500 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 14:26:55,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:26:55 BoogieIcfgContainer [2018-11-18 14:26:55,502 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 14:26:55,502 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 14:26:55,502 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 14:26:55,505 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 14:26:55,506 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 14:26:55,506 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 02:26:52" (1/3) ... [2018-11-18 14:26:55,507 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d5f9ba2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 02:26:55, skipping insertion in model container [2018-11-18 14:26:55,507 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 14:26:55,507 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:26:53" (2/3) ... [2018-11-18 14:26:55,508 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d5f9ba2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 02:26:55, skipping insertion in model container [2018-11-18 14:26:55,508 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 14:26:55,508 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:26:55" (3/3) ... [2018-11-18 14:26:55,511 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label26_true-unreach-call_false-termination.c [2018-11-18 14:26:55,557 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 14:26:55,558 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 14:26:55,558 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 14:26:55,558 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 14:26:55,558 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 14:26:55,560 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 14:26:55,560 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 14:26:55,560 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 14:26:55,560 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 14:26:55,591 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-18 14:26:55,649 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-18 14:26:55,651 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:26:55,651 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:26:55,663 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 14:26:55,664 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 14:26:55,664 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 14:26:55,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-18 14:26:55,680 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-18 14:26:55,682 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:26:55,682 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:26:55,683 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 14:26:55,683 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 14:26:55,693 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 14:26:55,693 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 14:26:55,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:26:55,701 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 14:26:55,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:26:55,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:26:55,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:26:55,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:26:55,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:26:55,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:26:55,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:26:55,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:26:55,817 INFO L82 PathProgramCache]: Analyzing trace with hash 34545679, now seen corresponding path program 1 times [2018-11-18 14:26:55,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:26:55,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:26:55,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:26:55,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:26:55,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:26:55,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:26:55,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:26:55,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:26:55,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1805985165, now seen corresponding path program 1 times [2018-11-18 14:26:55,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:26:55,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:26:55,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:26:55,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:26:55,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:26:55,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:26:56,013 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 14:26:56,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:26:56,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 14:26:56,433 WARN L180 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2018-11-18 14:26:56,604 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-11-18 14:26:56,619 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 14:26:56,620 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 14:26:56,620 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 14:26:56,620 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 14:26:56,621 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 14:26:56,621 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:26:56,621 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 14:26:56,621 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 14:26:56,621 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label26_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-18 14:26:56,622 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 14:26:56,622 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 14:26:56,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:26:56,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:26:56,822 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 16 [2018-11-18 14:26:56,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:26:56,841 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 14:26:56,883 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 14:26:56,895 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 14:26:56,907 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 14:26:56,983 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 14:26:57,501 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2018-11-18 14:26:57,541 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 14:26:57,542 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fccea397-e2f3-4697-ad4f-c02716ab6be5/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 14:26:57,547 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:26:57,547 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:26:57,552 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 14:26:57,552 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_fccea397-e2f3-4697-ad4f-c02716ab6be5/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 14:26:57,571 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:26:57,571 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:26:57,581 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 14:26:57,582 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_fccea397-e2f3-4697-ad4f-c02716ab6be5/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 14:26:57,618 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:26:57,618 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:26:57,622 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 14:26:57,622 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_fccea397-e2f3-4697-ad4f-c02716ab6be5/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 14:26:57,665 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:26:57,665 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:26:57,679 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 14:26:57,679 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_fccea397-e2f3-4697-ad4f-c02716ab6be5/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 14:26:57,705 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:26:57,705 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:26:57,710 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 14:26:57,710 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_fccea397-e2f3-4697-ad4f-c02716ab6be5/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 14:26:57,726 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:26:57,726 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:26:57,728 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 14:26:57,729 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_fccea397-e2f3-4697-ad4f-c02716ab6be5/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 14:26:57,755 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:26:57,755 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:26:57,762 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 14:26:57,762 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_fccea397-e2f3-4697-ad4f-c02716ab6be5/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 14:26:57,787 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:26:57,787 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fccea397-e2f3-4697-ad4f-c02716ab6be5/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 14:26:57,813 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 14:26:57,813 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:26:57,834 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 14:26:57,836 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 14:26:57,836 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 14:26:57,836 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 14:26:57,836 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 14:26:57,836 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 14:26:57,836 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:26:57,836 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 14:26:57,837 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 14:26:57,837 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label26_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-18 14:26:57,837 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 14:26:57,837 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 14:26:57,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:26:57,844 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 14:26:57,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:26:57,864 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 14:26:57,867 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 14:26:57,868 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 14:26:57,870 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 14:26:57,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 14:26:58,086 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-18 14:26:58,259 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 14:26:58,263 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 14:26:58,264 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:58,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:26:58,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:58,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:26:58,268 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:26:58,268 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:58,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:58,278 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:58,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:26:58,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:58,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:26:58,282 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:26:58,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:58,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:58,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:58,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:26:58,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,289 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 14:26:58,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:26:58,290 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:26:58,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:58,310 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:58,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 14:26:58,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:26:58,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:58,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:26:58,313 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:26:58,313 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:58,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:58,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:58,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:26:58,318 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:58,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:26:58,318 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:26:58,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:58,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:58,321 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:58,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:26:58,322 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:58,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:26:58,322 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:26:58,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:58,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:58,325 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:58,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:26:58,326 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:58,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:26:58,326 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:26:58,327 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:58,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:58,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 14:26:58,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:26:58,328 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,329 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 14:26:58,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:26:58,329 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 14:26:58,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:58,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:58,336 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-18 14:26:58,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:58,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:26:58,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:58,338 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 14:26:58,339 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 14:26:58,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:58,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:58,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:58,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:26:58,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:58,353 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 14:26:58,354 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 14:26:58,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:58,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:58,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:58,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:26:58,365 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,365 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 14:26:58,365 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 14:26:58,367 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 14:26:58,367 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:58,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:58,406 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:58,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:26:58,407 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:58,407 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 14:26:58,408 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 14:26:58,408 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:58,414 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:58,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 14:26:58,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:26:58,415 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:58,416 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 14:26:58,416 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 14:26:58,416 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:58,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:58,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:58,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:26:58,422 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:58,423 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 14:26:58,423 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 14:26:58,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:58,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:58,428 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:58,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:26:58,429 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:58,431 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 14:26:58,431 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 14:26:58,431 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:58,432 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:58,433 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:58,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:26:58,433 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,433 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 14:26:58,434 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 14:26:58,434 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:26:58,434 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:58,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:58,449 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-18 14:26:58,450 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:58,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:26:58,450 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:58,451 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 14:26:58,452 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 14:26:58,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:58,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:58,466 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:58,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:26:58,473 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:58,475 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 14:26:58,476 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 14:26:58,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:58,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:58,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 14:26:58,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:26:58,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,480 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 14:26:58,480 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 14:26:58,489 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 14:26:58,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:58,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:58,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:58,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:26:58,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:58,520 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 14:26:58,521 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 14:26:58,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:58,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:58,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 14:26:58,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:26:58,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:58,527 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 14:26:58,527 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 14:26:58,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:58,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:58,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:58,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:26:58,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:58,530 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 14:26:58,531 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 14:26:58,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:58,533 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:58,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:58,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:26:58,534 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:58,534 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 14:26:58,535 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 14:26:58,535 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:58,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:58,536 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:58,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:26:58,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,537 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 14:26:58,537 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 14:26:58,538 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 14:26:58,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:58,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:58,542 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-18 14:26:58,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:58,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:26:58,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:58,544 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 14:26:58,545 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 14:26:58,545 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:58,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:58,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:58,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:26:58,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:58,562 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 14:26:58,563 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 14:26:58,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:58,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:58,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:58,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:26:58,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,571 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 14:26:58,607 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 14:26:58,609 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 14:26:58,609 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:58,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:58,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:58,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:26:58,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:58,648 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 14:26:58,649 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 14:26:58,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:58,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:58,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:58,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:26:58,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:58,663 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 14:26:58,663 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 14:26:58,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:58,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:58,666 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:58,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:26:58,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:58,667 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 14:26:58,667 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 14:26:58,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:58,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:58,673 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:58,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:26:58,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:58,674 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 14:26:58,674 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 14:26:58,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:58,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:58,675 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:58,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:26:58,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,676 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 14:26:58,676 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 14:26:58,677 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 14:26:58,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:58,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:58,686 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-18 14:26:58,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:58,687 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:26:58,687 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 14:26:58,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:58,688 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 14:26:58,692 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 14:26:58,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:58,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:58,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:58,708 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:26:58,708 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 14:26:58,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:58,709 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 14:26:58,711 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 14:26:58,711 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:58,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:58,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:58,715 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:26:58,715 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 14:26:58,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,716 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 14:26:58,716 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 14:26:58,724 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 14:26:58,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:58,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:58,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:58,767 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:26:58,768 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 14:26:58,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:58,768 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 14:26:58,769 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 14:26:58,769 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:58,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:58,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:58,773 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:26:58,773 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 14:26:58,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:58,775 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 14:26:58,775 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 14:26:58,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:58,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:58,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 14:26:58,779 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:26:58,779 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 14:26:58,779 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:58,779 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 14:26:58,780 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 14:26:58,780 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:58,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:58,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 14:26:58,784 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:26:58,784 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 14:26:58,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:58,785 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 14:26:58,785 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 14:26:58,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:58,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:58,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:58,787 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:26:58,787 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 14:26:58,787 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,787 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 14:26:58,787 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 14:26:58,788 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:26:58,788 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:58,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:58,796 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-18 14:26:58,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:58,796 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:26:58,797 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 14:26:58,797 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:58,797 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 14:26:58,802 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 14:26:58,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:58,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:58,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:58,820 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:26:58,820 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 14:26:58,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:58,821 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 14:26:58,821 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 14:26:58,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:58,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:58,825 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:58,826 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:26:58,826 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 14:26:58,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,827 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 14:26:58,827 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 14:26:58,831 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 14:26:58,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:58,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:58,870 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:58,870 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:26:58,870 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 14:26:58,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:58,871 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 14:26:58,872 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 14:26:58,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:58,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:58,877 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:58,878 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:26:58,878 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 14:26:58,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:58,879 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 14:26:58,879 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 14:26:58,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:58,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:58,883 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:58,883 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:26:58,883 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 14:26:58,883 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:58,884 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 14:26:58,884 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 14:26:58,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:58,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:58,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:58,889 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:26:58,889 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 14:26:58,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:58,889 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 14:26:58,890 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 14:26:58,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:58,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:58,892 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:58,892 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:26:58,892 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 14:26:58,892 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,893 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 14:26:58,893 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 14:26:58,895 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 14:26:58,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:58,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:58,904 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-18 14:26:58,904 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:58,905 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:26:58,905 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 14:26:58,905 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:58,906 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 14:26:58,908 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 14:26:58,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:58,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:58,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:58,920 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:26:58,920 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 14:26:58,921 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:58,921 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 14:26:58,922 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 14:26:58,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:58,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:58,927 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:58,928 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:26:58,928 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 14:26:58,928 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,928 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 14:26:58,929 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 14:26:58,934 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 14:26:58,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:58,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:58,979 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:58,980 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:26:58,980 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 14:26:58,980 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:58,980 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 14:26:58,982 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 14:26:58,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:58,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:58,988 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:58,988 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:26:58,989 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 14:26:58,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:58,989 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 14:26:58,990 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 14:26:58,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:58,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:58,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:58,994 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:26:58,995 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 14:26:58,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:58,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:58,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:58,995 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 14:26:58,996 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 14:26:58,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:59,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:59,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:59,001 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:26:59,001 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 14:26:59,001 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:59,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:59,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:59,001 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 14:26:59,002 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 14:26:59,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:59,003 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:59,003 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:59,003 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:26:59,004 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 14:26:59,004 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:59,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:59,004 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 14:26:59,004 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 14:26:59,006 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 14:26:59,006 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:59,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:59,015 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-18 14:26:59,015 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:59,016 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:26:59,016 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 14:26:59,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:59,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:59,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:59,016 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 14:26:59,017 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 14:26:59,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:59,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:59,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:59,028 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:26:59,028 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 14:26:59,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:59,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:59,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:59,029 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 14:26:59,029 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 14:26:59,029 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:59,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:59,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:59,031 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:26:59,032 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 14:26:59,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:59,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:59,032 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 14:26:59,032 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 14:26:59,038 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 14:26:59,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:59,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:59,054 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:59,055 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:26:59,055 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 14:26:59,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:59,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:59,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:59,055 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 14:26:59,056 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 14:26:59,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:59,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:59,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 14:26:59,065 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:26:59,065 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 14:26:59,065 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:59,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:59,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:59,066 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 14:26:59,066 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 14:26:59,066 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:59,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:59,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:59,070 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:26:59,070 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 14:26:59,071 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:59,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:59,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:59,071 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 14:26:59,071 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 14:26:59,071 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:59,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:59,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:59,077 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:26:59,077 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 14:26:59,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:59,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:59,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:59,078 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 14:26:59,078 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 14:26:59,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:59,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:59,080 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:59,080 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:26:59,080 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 14:26:59,080 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:59,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:59,080 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 14:26:59,080 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 14:26:59,081 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 14:26:59,081 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:59,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:59,093 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-18 14:26:59,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 14:26:59,094 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:26:59,094 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 14:26:59,094 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:59,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:59,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:59,095 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 14:26:59,096 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:26:59,096 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:59,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:59,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:59,126 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:26:59,126 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 14:26:59,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:59,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:59,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:59,126 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 14:26:59,127 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:26:59,127 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:59,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:59,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:59,134 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:26:59,134 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 14:26:59,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:59,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:59,134 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 14:26:59,134 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 14:26:59,140 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-18 14:26:59,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:59,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:59,216 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:59,218 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:26:59,218 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 14:26:59,218 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:59,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:59,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:59,219 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 14:26:59,220 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:26:59,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:59,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:59,236 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:59,237 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:26:59,237 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 14:26:59,237 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:59,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:59,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:59,237 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 14:26:59,237 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:26:59,238 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:59,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:59,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:59,241 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:26:59,241 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 14:26:59,241 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:59,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:59,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:59,241 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 14:26:59,252 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:26:59,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:59,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:59,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 14:26:59,255 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:26:59,255 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 14:26:59,255 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:59,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:59,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:26:59,259 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 14:26:59,260 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:26:59,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:59,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:59,264 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:26:59,266 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:26:59,266 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 14:26:59,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:26:59,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:26:59,266 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 14:26:59,267 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 14:26:59,269 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 14:26:59,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:26:59,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:26:59,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:26:59,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:26:59,294 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 3 states. [2018-11-18 14:27:00,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:27:00,364 INFO L93 Difference]: Finished difference Result 381 states and 548 transitions. [2018-11-18 14:27:00,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:27:00,366 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 381 states and 548 transitions. [2018-11-18 14:27:00,371 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 372 [2018-11-18 14:27:00,377 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 381 states to 374 states and 541 transitions. [2018-11-18 14:27:00,378 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 374 [2018-11-18 14:27:00,379 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 374 [2018-11-18 14:27:00,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 374 states and 541 transitions. [2018-11-18 14:27:00,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 14:27:00,382 INFO L705 BuchiCegarLoop]: Abstraction has 374 states and 541 transitions. [2018-11-18 14:27:00,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states and 541 transitions. [2018-11-18 14:27:00,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2018-11-18 14:27:00,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-11-18 14:27:00,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 539 transitions. [2018-11-18 14:27:00,414 INFO L728 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-18 14:27:00,414 INFO L608 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-18 14:27:00,414 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 14:27:00,414 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 373 states and 539 transitions. [2018-11-18 14:27:00,415 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 371 [2018-11-18 14:27:00,415 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:27:00,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:27:00,416 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 14:27:00,416 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:27:00,416 INFO L794 eck$LassoCheckResult]: Stem: 750#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 631#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 632#L606-3 [2018-11-18 14:27:00,416 INFO L796 eck$LassoCheckResult]: Loop: 632#L606-3 assume true; 853#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 732#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 733#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 879#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 759#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 695#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 696#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); 847#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 633#L54 assume (((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0);~a28~0 := 7;~a11~0 := 1;~a25~0 := 0;calculate_output_#res := -1; 634#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 632#L606-3 [2018-11-18 14:27:00,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:27:00,417 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-18 14:27:00,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:27:00,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:27:00,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:00,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:27:00,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:00,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:27:00,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:27:00,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:27:00,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1956321088, now seen corresponding path program 1 times [2018-11-18 14:27:00,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:27:00,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:27:00,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:00,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:27:00,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:00,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:27:00,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:27:00,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:27:00,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1962170302, now seen corresponding path program 1 times [2018-11-18 14:27:00,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:27:00,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:27:00,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:00,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:27:00,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:00,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:27:00,510 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 14:27:00,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:27:00,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 14:27:01,093 WARN L180 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 41 [2018-11-18 14:27:01,118 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 14:27:01,118 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 14:27:01,118 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 14:27:01,119 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 14:27:01,119 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 14:27:01,119 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:27:01,119 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 14:27:01,119 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 14:27:01,119 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label26_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-18 14:27:01,119 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 14:27:01,119 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 14:27:01,121 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 14:27:01,127 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 14:27:01,131 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 14:27:01,133 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 14:27:01,134 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 14:27:01,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:27:01,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:27:01,171 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 14:27:01,283 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 14:27:01,283 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fccea397-e2f3-4697-ad4f-c02716ab6be5/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 14:27:01,286 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:27:01,286 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:27:01,288 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 14:27:01,288 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_fccea397-e2f3-4697-ad4f-c02716ab6be5/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 14:27:01,305 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:27:01,305 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:27:01,308 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 14:27:01,308 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_fccea397-e2f3-4697-ad4f-c02716ab6be5/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 14:27:01,325 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:27:01,325 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:27:01,327 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 14:27:01,327 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_fccea397-e2f3-4697-ad4f-c02716ab6be5/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 14:27:01,346 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:27:01,346 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:27:01,347 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 14:27:01,348 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_fccea397-e2f3-4697-ad4f-c02716ab6be5/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 14:27:01,364 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:27:01,364 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:27:01,366 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 14:27:01,366 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_fccea397-e2f3-4697-ad4f-c02716ab6be5/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 14:27:01,383 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:27:01,384 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fccea397-e2f3-4697-ad4f-c02716ab6be5/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 14:27:01,412 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 14:27:01,413 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:27:01,435 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 14:27:01,436 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 14:27:01,437 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 14:27:01,437 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 14:27:01,437 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 14:27:01,437 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 14:27:01,437 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:27:01,437 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 14:27:01,437 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 14:27:01,437 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label26_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-18 14:27:01,437 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 14:27:01,437 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 14:27:01,439 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 14:27:01,441 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 14:27:01,461 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 14:27:01,467 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 14:27:01,469 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 14:27:01,502 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 14:27:01,538 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 14:27:01,621 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 14:27:01,868 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 14:27:01,868 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 14:27:01,868 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:01,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:27:01,869 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:01,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:01,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:27:01,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:27:01,873 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:27:01,873 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:01,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:01,874 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:01,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:27:01,874 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:01,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:01,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:27:01,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:27:01,875 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:27:01,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:01,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:01,876 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:01,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:27:01,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:01,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:01,877 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 14:27:01,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:27:01,877 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 14:27:01,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:01,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:01,878 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:01,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:27:01,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:01,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:01,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:27:01,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:27:01,935 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:27:01,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:01,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:01,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:01,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:27:01,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:01,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:01,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:27:01,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:27:01,937 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:27:01,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:01,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:01,938 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:01,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:27:01,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:01,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:01,939 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 14:27:01,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:27:01,939 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 14:27:01,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:01,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:01,941 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:01,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:27:01,941 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:01,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:01,942 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 14:27:01,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:27:01,942 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 14:27:01,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:01,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:01,945 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:01,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:27:01,945 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:01,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:01,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:27:01,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:27:01,960 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:27:01,960 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:01,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:01,961 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-18 14:27:01,961 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:01,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:27:01,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:01,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:01,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:27:01,962 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 14:27:01,962 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 14:27:01,962 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:01,963 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:01,963 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:01,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:27:01,964 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:01,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:01,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:27:01,964 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 14:27:01,964 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 14:27:01,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:01,974 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:01,974 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:01,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:27:01,975 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:01,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:01,975 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 14:27:01,975 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 14:27:01,976 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:27:01,976 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:01,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:01,976 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:01,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:27:01,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:01,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:01,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:27:01,985 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 14:27:01,986 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 14:27:01,986 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:01,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:01,987 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:01,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:27:01,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:01,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:01,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:27:01,987 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 14:27:01,987 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 14:27:01,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:01,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:01,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:01,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:27:01,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:01,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:01,989 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 14:27:01,989 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 14:27:01,990 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:27:01,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:01,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:01,992 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:01,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:27:01,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:01,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:01,992 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 14:27:01,992 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 14:27:01,993 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:27:01,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:01,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:01,996 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:01,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:27:01,996 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:01,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:01,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:27:01,997 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 14:27:01,997 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 14:27:01,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,001 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-18 14:27:02,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:02,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:27:02,001 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:27:02,002 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 14:27:02,002 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 14:27:02,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,003 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,003 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:02,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:27:02,004 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:27:02,004 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 14:27:02,004 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 14:27:02,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:02,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:27:02,008 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,009 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 14:27:02,009 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 14:27:02,009 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 14:27:02,009 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,009 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:02,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:27:02,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:27:02,010 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 14:27:02,011 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 14:27:02,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,011 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:02,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:27:02,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:27:02,012 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 14:27:02,012 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 14:27:02,012 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,013 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:02,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:27:02,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,017 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 14:27:02,017 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 14:27:02,017 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 14:27:02,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,019 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,020 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:02,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:27:02,020 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,020 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 14:27:02,020 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 14:27:02,021 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 14:27:02,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,029 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:02,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:27:02,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:27:02,030 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 14:27:02,031 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 14:27:02,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,034 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-18 14:27:02,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:02,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:27:02,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:27:02,035 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 14:27:02,036 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 14:27:02,036 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:02,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:27:02,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:27:02,039 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 14:27:02,039 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 14:27:02,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:02,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:27:02,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,043 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 14:27:02,043 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 14:27:02,043 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 14:27:02,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,044 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:02,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:27:02,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:27:02,045 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 14:27:02,046 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 14:27:02,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:02,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:27:02,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:27:02,047 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 14:27:02,048 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 14:27:02,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,050 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:02,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:27:02,051 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,051 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 14:27:02,051 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 14:27:02,052 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 14:27:02,052 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,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 14:27:02,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:27:02,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,055 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 14:27:02,055 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 14:27:02,056 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 14:27:02,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,060 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,060 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:02,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:27:02,061 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:27:02,062 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 14:27:02,062 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 14:27:02,062 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,066 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-18 14:27:02,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 14:27:02,066 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:27:02,066 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 14:27:02,066 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:27:02,067 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 14:27:02,067 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 14:27:02,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:02,069 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:27:02,070 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 14:27:02,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:27:02,071 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 14:27:02,071 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 14:27:02,071 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,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 14:27:02,075 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:27:02,075 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 14:27:02,075 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,075 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 14:27:02,075 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 14:27:02,075 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:27:02,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,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 14:27:02,077 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:27:02,077 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 14:27:02,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:27:02,077 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 14:27:02,079 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 14:27:02,079 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,080 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,080 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:02,080 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:27:02,081 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 14:27:02,081 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:27:02,081 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 14:27:02,081 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 14:27:02,081 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,083 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:02,083 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:27:02,083 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 14:27:02,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,084 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 14:27:02,084 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 14:27:02,084 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:27:02,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:02,089 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:27:02,089 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 14:27:02,089 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,090 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 14:27:02,090 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 14:27:02,091 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:27:02,091 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,097 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,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 14:27:02,098 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:27:02,098 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 14:27:02,098 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:27:02,098 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 14:27:02,099 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 14:27:02,099 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,103 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-18 14:27:02,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:02,103 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:27:02,103 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 14:27:02,104 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:27:02,104 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 14:27:02,104 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 14:27:02,104 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:02,113 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:27:02,113 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 14:27:02,115 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:27:02,115 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 14:27:02,116 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 14:27:02,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,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 14:27:02,120 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:27:02,120 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 14:27:02,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,120 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 14:27:02,120 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 14:27:02,122 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 14:27:02,122 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,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 14:27:02,123 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:27:02,123 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 14:27:02,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:27:02,124 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 14:27:02,124 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 14:27:02,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,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 14:27:02,126 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:27:02,126 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 14:27:02,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:27:02,126 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 14:27:02,127 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 14:27:02,127 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,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 14:27:02,130 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:27:02,130 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 14:27:02,130 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,130 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 14:27:02,130 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 14:27:02,131 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 14:27:02,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:02,137 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:27:02,138 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 14:27:02,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,138 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 14:27:02,138 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 14:27:02,139 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 14:27:02,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,150 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:02,151 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:27:02,151 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 14:27:02,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:27:02,151 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 14:27:02,152 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 14:27:02,152 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,158 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-18 14:27:02,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:02,159 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:27:02,159 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 14:27:02,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:27:02,160 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 14:27:02,160 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 14:27:02,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,164 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:02,165 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:27:02,165 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 14:27:02,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:27:02,165 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 14:27:02,167 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 14:27:02,167 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:02,173 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:27:02,173 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 14:27:02,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,173 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 14:27:02,173 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 14:27:02,183 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 14:27:02,183 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,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 14:27:02,185 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:27:02,185 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 14:27:02,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:27:02,185 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 14:27:02,186 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 14:27:02,186 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,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 14:27:02,187 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:27:02,187 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 14:27:02,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:27:02,188 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 14:27:02,188 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 14:27:02,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,192 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:02,192 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:27:02,192 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 14:27:02,192 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,193 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 14:27:02,193 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 14:27:02,194 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 14:27:02,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,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 14:27:02,203 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:27:02,203 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 14:27:02,203 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,203 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 14:27:02,203 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 14:27:02,207 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 14:27:02,207 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:02,227 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:27:02,227 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 14:27:02,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:27:02,227 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 14:27:02,229 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 14:27:02,230 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,238 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-18 14:27:02,239 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:02,239 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:27:02,239 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 14:27:02,239 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:27:02,240 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 14:27:02,240 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 14:27:02,240 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,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 14:27:02,246 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:27:02,246 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 14:27:02,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:27:02,247 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 14:27:02,247 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 14:27:02,247 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,250 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:02,251 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:27:02,251 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 14:27:02,251 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,251 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 14:27:02,251 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 14:27:02,252 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 14:27:02,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,253 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:02,254 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:27:02,254 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 14:27:02,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:27:02,254 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 14:27:02,254 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 14:27:02,254 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:02,256 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:27:02,256 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 14:27:02,256 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:27:02,256 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 14:27:02,257 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 14:27:02,257 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,259 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:02,259 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:27:02,259 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 14:27:02,259 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,260 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 14:27:02,260 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 14:27:02,260 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 14:27:02,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,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 14:27:02,265 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:27:02,265 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 14:27:02,265 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,265 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 14:27:02,265 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 14:27:02,266 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 14:27:02,266 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:02,273 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:27:02,273 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 14:27:02,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:27:02,273 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 14:27:02,274 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 14:27:02,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,284 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-18 14:27:02,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:02,285 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:27:02,285 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 14:27:02,285 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:27:02,285 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 14:27:02,286 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:27:02,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,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 14:27:02,289 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:27:02,289 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 14:27:02,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:27:02,289 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 14:27:02,290 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:27:02,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,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 14:27:02,296 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:27:02,296 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 14:27:02,296 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,296 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 14:27:02,296 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 14:27:02,297 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 14:27:02,297 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,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 14:27:02,300 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:27:02,300 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 14:27:02,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:27:02,301 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 14:27:02,301 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:27:02,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,303 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:02,304 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:27:02,304 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 14:27:02,304 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:27:02,304 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 14:27:02,305 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:27:02,305 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,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 14:27:02,308 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:27:02,308 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 14:27:02,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,308 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 14:27:02,308 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 14:27:02,309 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 14:27:02,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,316 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:02,317 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:27:02,317 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 14:27:02,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,317 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 14:27:02,318 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 14:27:02,319 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 14:27:02,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:27:02,348 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 14:27:02,348 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 14:27:02,348 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:27:02,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:27:02,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:27:02,349 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 14:27:02,350 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:27:02,350 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:27:02,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:27:02,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:27:02,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:27:02,381 INFO L87 Difference]: Start difference. First operand 373 states and 539 transitions. cyclomatic complexity: 167 Second operand 3 states. [2018-11-18 14:27:03,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:27:03,019 INFO L93 Difference]: Finished difference Result 660 states and 918 transitions. [2018-11-18 14:27:03,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:27:03,020 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 660 states and 918 transitions. [2018-11-18 14:27:03,024 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-18 14:27:03,028 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 660 states to 660 states and 918 transitions. [2018-11-18 14:27:03,028 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 660 [2018-11-18 14:27:03,030 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 660 [2018-11-18 14:27:03,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 660 states and 918 transitions. [2018-11-18 14:27:03,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 14:27:03,032 INFO L705 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-11-18 14:27:03,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states and 918 transitions. [2018-11-18 14:27:03,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2018-11-18 14:27:03,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2018-11-18 14:27:03,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 918 transitions. [2018-11-18 14:27:03,051 INFO L728 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-11-18 14:27:03,051 INFO L608 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-11-18 14:27:03,051 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 14:27:03,051 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 660 states and 918 transitions. [2018-11-18 14:27:03,054 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-18 14:27:03,054 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:27:03,055 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:27:03,056 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 14:27:03,056 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 14:27:03,056 INFO L794 eck$LassoCheckResult]: Stem: 1799#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 1672#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 1673#L606-3 [2018-11-18 14:27:03,057 INFO L796 eck$LassoCheckResult]: Loop: 1673#L606-3 assume true; 2318#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1779#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; 1780#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); 1959#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; 1684#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1936#L606-3 assume true; 1928#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1929#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; 2317#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); 2316#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 2315#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); 2314#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 2313#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); 2312#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 2311#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)); 2310#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); 2309#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); 2308#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); 2306#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 2305#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); 2293#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 2292#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 2178#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 2179#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); 2209#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); 2208#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 2205#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); 2204#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 2176#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 2177#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); 2193#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 2190#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); 2188#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); 2185#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 1777#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 1778#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 2180#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 2164#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); 2163#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 2161#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 2159#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 2157#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); 2156#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 2155#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 2153#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); 2154#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 1761#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); 1762#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); 2255#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 2217#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); 2203#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 2202#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 2200#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)); 2199#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); 2198#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; 2192#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1673#L606-3 [2018-11-18 14:27:03,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:27:03,057 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-18 14:27:03,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:27:03,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:27:03,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:03,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:27:03,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:03,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:27:03,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:27:03,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:27:03,062 INFO L82 PathProgramCache]: Analyzing trace with hash 692590236, now seen corresponding path program 1 times [2018-11-18 14:27:03,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:27:03,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:27:03,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:03,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:27:03,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:03,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:27:03,237 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 14:27:03,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:27:03,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 14:27:03,238 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 14:27:03,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 14:27:03,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 14:27:03,238 INFO L87 Difference]: Start difference. First operand 660 states and 918 transitions. cyclomatic complexity: 259 Second operand 4 states. [2018-11-18 14:27:05,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:27:05,410 INFO L93 Difference]: Finished difference Result 1228 states and 1697 transitions. [2018-11-18 14:27:05,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 14:27:05,411 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1228 states and 1697 transitions. [2018-11-18 14:27:05,419 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1224 [2018-11-18 14:27:05,425 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1228 states to 1228 states and 1697 transitions. [2018-11-18 14:27:05,425 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1228 [2018-11-18 14:27:05,428 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1228 [2018-11-18 14:27:05,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1228 states and 1697 transitions. [2018-11-18 14:27:05,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 14:27:05,431 INFO L705 BuchiCegarLoop]: Abstraction has 1228 states and 1697 transitions. [2018-11-18 14:27:05,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states and 1697 transitions. [2018-11-18 14:27:05,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1225. [2018-11-18 14:27:05,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2018-11-18 14:27:05,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1691 transitions. [2018-11-18 14:27:05,456 INFO L728 BuchiCegarLoop]: Abstraction has 1225 states and 1691 transitions. [2018-11-18 14:27:05,456 INFO L608 BuchiCegarLoop]: Abstraction has 1225 states and 1691 transitions. [2018-11-18 14:27:05,456 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 14:27:05,456 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1225 states and 1691 transitions. [2018-11-18 14:27:05,463 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1221 [2018-11-18 14:27:05,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:27:05,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:27:05,465 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 14:27:05,465 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 14:27:05,465 INFO L794 eck$LassoCheckResult]: Stem: 3695#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; 3568#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; 3569#L606-3 [2018-11-18 14:27:05,468 INFO L796 eck$LassoCheckResult]: Loop: 3569#L606-3 assume true; 4742#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4740#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; 4738#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); 4736#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 4734#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); 4732#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3829#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); 3830#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; 3599#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4363#L606-3 assume true; 4360#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4358#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; 4357#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; 3797#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4215#L606-3 assume true; 4213#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4211#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; 4209#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); 4207#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 4205#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); 4203#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 4201#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); 4199#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 4197#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)); 4195#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); 4193#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); 4191#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); 4189#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 4187#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); 4185#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 4183#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 4181#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 4179#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); 4177#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); 4175#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 4173#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); 4171#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 4169#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 4167#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); 4165#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 4163#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); 4161#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); 4159#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 4157#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 4155#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 4153#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 4151#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); 4149#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 4147#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 4145#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 4143#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); 4141#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 4139#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 4137#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); 4135#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 4133#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); 4131#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); 4129#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 4127#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); 4125#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 4123#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 4121#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)); 4116#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); 4112#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; 4113#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3569#L606-3 [2018-11-18 14:27:05,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:27:05,469 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-18 14:27:05,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:27:05,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:27:05,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:05,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:27:05,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:05,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:27:05,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:27:05,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:27:05,484 INFO L82 PathProgramCache]: Analyzing trace with hash 676565178, now seen corresponding path program 1 times [2018-11-18 14:27:05,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:27:05,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:27:05,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:05,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:27:05,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:05,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:27:05,586 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 14:27:05,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:27:05,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:27:05,587 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 14:27:05,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:27:05,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:27:05,587 INFO L87 Difference]: Start difference. First operand 1225 states and 1691 transitions. cyclomatic complexity: 468 Second operand 3 states. [2018-11-18 14:27:08,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:27:08,135 INFO L93 Difference]: Finished difference Result 1509 states and 2000 transitions. [2018-11-18 14:27:08,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:27:08,136 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1509 states and 2000 transitions. [2018-11-18 14:27:08,154 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1505 [2018-11-18 14:27:08,167 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1509 states to 1509 states and 2000 transitions. [2018-11-18 14:27:08,167 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1509 [2018-11-18 14:27:08,168 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1509 [2018-11-18 14:27:08,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1509 states and 2000 transitions. [2018-11-18 14:27:08,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 14:27:08,181 INFO L705 BuchiCegarLoop]: Abstraction has 1509 states and 2000 transitions. [2018-11-18 14:27:08,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states and 2000 transitions. [2018-11-18 14:27:08,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1508. [2018-11-18 14:27:08,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1508 states. [2018-11-18 14:27:08,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 1998 transitions. [2018-11-18 14:27:08,216 INFO L728 BuchiCegarLoop]: Abstraction has 1508 states and 1998 transitions. [2018-11-18 14:27:08,216 INFO L608 BuchiCegarLoop]: Abstraction has 1508 states and 1998 transitions. [2018-11-18 14:27:08,217 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 14:27:08,217 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1508 states and 1998 transitions. [2018-11-18 14:27:08,224 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-18 14:27:08,233 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:27:08,233 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:27:08,235 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 14:27:08,235 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 14:27:08,235 INFO L794 eck$LassoCheckResult]: Stem: 6433#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 6307#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 6308#L606-3 [2018-11-18 14:27:08,235 INFO L796 eck$LassoCheckResult]: Loop: 6308#L606-3 assume true; 7441#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7439#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; 7437#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); 7435#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 7433#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); 7431#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 7429#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); 7427#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 7425#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)); 7423#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); 7421#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); 7419#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); 7410#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 7409#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); 7407#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 7405#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 7403#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 7401#L106 assume (1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0;~a17~0 := 8;~a25~0 := 0;~a19~0 := 0;~a28~0 := 11;~a11~0 := 0;calculate_output_#res := 23; 6542#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 7085#L606-3 assume true; 7083#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7081#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; 7079#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; 6453#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 7260#L606-3 assume true; 7259#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7258#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; 7257#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); 7255#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 7253#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); 7251#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 7250#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); 7246#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 7245#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)); 7243#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); 7241#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); 7239#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); 7237#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 7235#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); 7233#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 7231#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 7229#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 7227#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); 7225#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); 7223#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 7221#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); 7219#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 7218#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 7217#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); 7216#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 7215#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); 7213#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); 7211#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 7209#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 7207#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 7205#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 7203#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); 7201#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 7199#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 7198#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 7197#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); 7196#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 7195#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 7194#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); 7192#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 7190#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); 7187#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); 7186#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 7185#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); 7184#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 7183#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 7182#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)); 7180#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); 7178#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; 7160#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6308#L606-3 [2018-11-18 14:27:08,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:27:08,235 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-18 14:27:08,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:27:08,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:27:08,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:08,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:27:08,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:08,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:27:08,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:27:08,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:27:08,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1219893882, now seen corresponding path program 1 times [2018-11-18 14:27:08,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:27:08,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:27:08,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:08,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:27:08,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:27:08,417 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 14:27:08,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:27:08,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:27:08,417 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 14:27:08,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:27:08,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:27:08,418 INFO L87 Difference]: Start difference. First operand 1508 states and 1998 transitions. cyclomatic complexity: 492 Second operand 3 states. [2018-11-18 14:27:10,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:27:10,391 INFO L93 Difference]: Finished difference Result 1507 states and 1821 transitions. [2018-11-18 14:27:10,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:27:10,392 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1507 states and 1821 transitions. [2018-11-18 14:27:10,399 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-18 14:27:10,404 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1507 states to 1507 states and 1821 transitions. [2018-11-18 14:27:10,405 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1507 [2018-11-18 14:27:10,407 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1507 [2018-11-18 14:27:10,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1507 states and 1821 transitions. [2018-11-18 14:27:10,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 14:27:10,409 INFO L705 BuchiCegarLoop]: Abstraction has 1507 states and 1821 transitions. [2018-11-18 14:27:10,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states and 1821 transitions. [2018-11-18 14:27:10,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1507. [2018-11-18 14:27:10,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2018-11-18 14:27:10,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1821 transitions. [2018-11-18 14:27:10,428 INFO L728 BuchiCegarLoop]: Abstraction has 1507 states and 1821 transitions. [2018-11-18 14:27:10,428 INFO L608 BuchiCegarLoop]: Abstraction has 1507 states and 1821 transitions. [2018-11-18 14:27:10,428 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 14:27:10,428 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1507 states and 1821 transitions. [2018-11-18 14:27:10,436 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-18 14:27:10,437 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:27:10,437 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:27:10,439 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 14:27:10,442 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 14:27:10,442 INFO L794 eck$LassoCheckResult]: Stem: 9455#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 9328#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 9329#L606-3 [2018-11-18 14:27:10,442 INFO L796 eck$LassoCheckResult]: Loop: 9329#L606-3 assume true; 9571#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 9434#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; 9435#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); 9601#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 10192#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); 10367#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 10366#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); 10364#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 10362#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)); 10360#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); 10358#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); 10356#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); 10354#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 10352#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); 10350#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 10348#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 10346#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 10334#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); 10335#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); 9399#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 9400#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); 9621#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 10619#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 10613#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); 10607#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10601#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); 10596#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); 10588#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 9784#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; 9676#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9778#L606-3 assume true; 9776#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 9774#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; 9772#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); 9770#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 9768#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); 9766#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 9764#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); 9762#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 9760#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)); 9758#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); 9756#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); 9754#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); 9752#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 9750#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); 9748#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 9746#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 9744#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 9742#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); 9740#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); 9738#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 9736#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); 9734#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 9732#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 9730#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); 9728#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 9726#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); 9724#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); 9721#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 9719#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 9717#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 9715#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 9713#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); 9711#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 9709#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 9707#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 9705#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); 9703#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 9701#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 9699#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); 9697#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 9695#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); 9693#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); 9691#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 9689#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); 9687#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 9685#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 9683#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)); 9681#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); 9679#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; 9479#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9329#L606-3 [2018-11-18 14:27:10,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:27:10,442 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-18 14:27:10,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:27:10,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:27:10,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:10,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:27:10,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:10,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:27:10,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:27:10,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:27:10,462 INFO L82 PathProgramCache]: Analyzing trace with hash -606648447, now seen corresponding path program 1 times [2018-11-18 14:27:10,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:27:10,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:27:10,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:10,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:27:10,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:10,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:27:10,690 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 14:27:10,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:27:10,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:27:10,691 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 14:27:10,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:27:10,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:27:10,691 INFO L87 Difference]: Start difference. First operand 1507 states and 1821 transitions. cyclomatic complexity: 316 Second operand 3 states. [2018-11-18 14:27:11,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:27:11,047 INFO L93 Difference]: Finished difference Result 1496 states and 1777 transitions. [2018-11-18 14:27:11,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:27:11,048 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1496 states and 1777 transitions. [2018-11-18 14:27:11,053 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-18 14:27:11,058 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1496 states to 1496 states and 1777 transitions. [2018-11-18 14:27:11,058 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1496 [2018-11-18 14:27:11,059 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1496 [2018-11-18 14:27:11,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1496 states and 1777 transitions. [2018-11-18 14:27:11,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 14:27:11,061 INFO L705 BuchiCegarLoop]: Abstraction has 1496 states and 1777 transitions. [2018-11-18 14:27:11,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states and 1777 transitions. [2018-11-18 14:27:11,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1496. [2018-11-18 14:27:11,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2018-11-18 14:27:11,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 1777 transitions. [2018-11-18 14:27:11,078 INFO L728 BuchiCegarLoop]: Abstraction has 1496 states and 1777 transitions. [2018-11-18 14:27:11,078 INFO L608 BuchiCegarLoop]: Abstraction has 1496 states and 1777 transitions. [2018-11-18 14:27:11,078 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 14:27:11,078 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1496 states and 1777 transitions. [2018-11-18 14:27:11,083 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-18 14:27:11,083 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:27:11,083 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:27:11,084 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 14:27:11,084 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 14:27:11,084 INFO L794 eck$LassoCheckResult]: Stem: 12457#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 12337#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 12338#L606-3 [2018-11-18 14:27:11,085 INFO L796 eck$LassoCheckResult]: Loop: 12338#L606-3 assume true; 13339#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 13337#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; 13336#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); 13334#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 13333#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); 13332#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 13331#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); 13329#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 13327#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)); 13320#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); 13319#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); 13317#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); 13315#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 13313#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); 13311#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 13309#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 13307#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 13305#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); 13303#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); 13301#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 13299#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); 13297#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 13295#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 13293#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); 13291#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13289#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); 13287#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); 13285#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 13283#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 13281#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 13279#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 13277#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); 13275#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 13273#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 13271#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 13269#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); 13267#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 13265#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 13263#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); 13261#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 13259#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); 13257#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); 13255#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 13253#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); 13251#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 13249#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 13247#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)); 13245#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); 13243#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); 13241#L259 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && (((9 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)); 13239#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); 13237#L276 assume !(7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 1 == ~a21~0 && 1 == ~a19~0 && 5 == calculate_output_~input && !(1 == ~a11~0)); 13235#L280 assume !(8 == ~a28~0 && 1 == ~a21~0 && (!(1 == ~a11~0) && (1 == calculate_output_~input && 8 == ~a17~0) && 1 == ~a19~0) && 1 == ~a25~0); 13233#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); 13231#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); 13229#L291 assume !(8 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a11~0) && 1 == ~a25~0 && 8 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a19~0); 13227#L293 assume !((1 == ~a19~0 && 8 == ~a17~0 && ((!(1 == ~a25~0) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a11~0)) && 11 == ~a28~0); 13225#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); 13223#L309 assume !((((((3 == calculate_output_~input && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)) && 11 == ~a28~0) && !(1 == ~a11~0)); 13221#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); 13219#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); 13217#L331 assume !((!(1 == ~a11~0) && (((4 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0) && 11 == ~a28~0) && 1 == ~a19~0); 13215#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)); 13213#L349 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && ((1 == ~a25~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 11 == ~a28~0) && 1 == ~a21~0); 13211#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); 13209#L361 assume !(1 == ~a19~0 && ((1 == ~a21~0 && (!(1 == ~a25~0) && 3 == calculate_output_~input) && 9 == ~a17~0) && 8 == ~a28~0) && 1 == ~a11~0); 13207#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)); 13205#L375 assume !(1 == ~a19~0 && (((8 == ~a17~0 && 5 == calculate_output_~input && !(1 == ~a11~0)) && 1 == ~a21~0) && 1 == ~a25~0) && 8 == ~a28~0); 13203#L378 assume !(((!(1 == ~a11~0) && ((1 == ~a21~0 && 4 == calculate_output_~input) && 10 == ~a28~0) && 8 == ~a17~0) && !(1 == ~a19~0)) && 1 == ~a25~0); 13201#L380 assume !(8 == ~a28~0 && (1 == ~a19~0 && 1 == ~a11~0 && !(1 == ~a25~0) && 9 == ~a17~0 && 6 == calculate_output_~input) && 1 == ~a21~0); 13199#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)); 13197#L394 assume !(((((!(1 == ~a25~0) && 1 == ~a19~0 && 3 == calculate_output_~input) && 9 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 13195#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)); 13193#L402 assume !(((!(1 == ~a11~0) && ((1 == ~a19~0 && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)); 13191#L404 assume !((1 == ~a11~0 && 1 == ~a19~0 && 1 == ~a21~0 && (9 == ~a17~0 && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 8 == ~a28~0); 13189#L407 assume !(!(1 == ~a11~0) && 1 == ~a21~0 && (1 == ~a19~0 && 8 == ~a17~0 && 1 == ~a25~0 && 5 == calculate_output_~input) && 11 == ~a28~0); 13187#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); 13185#L414 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13183#L414-2 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13181#L417-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13179#L420-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13177#L423-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13175#L426-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13173#L429-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13171#L432-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13169#L435-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12354#L438-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13166#L441-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13164#L444-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13162#L447-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13160#L450-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13158#L453-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13156#L456-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13154#L459-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13152#L462-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13150#L465-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13147#L468-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13145#L471-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13143#L474-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13141#L477-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13139#L480-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13137#L483-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13135#L486-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13133#L489-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13131#L492-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13129#L495-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13128#L498-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13127#L501-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13125#L504-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13123#L507-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13121#L510-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13120#L513-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12487#L516-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13394#L519-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13392#L522-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13390#L525-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13388#L528-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13386#L531-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13384#L534-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13382#L537-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13380#L540-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13378#L543-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13376#L546-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13374#L549-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13372#L552-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13370#L555-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13368#L558-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13366#L561-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13364#L564-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13362#L567-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13360#L570-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13358#L573-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13356#L576-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13354#L579-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13352#L582-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13350#L585-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13348#L588-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13346#L591-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13344#L594-1 calculate_output_#res := -2; 13342#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 12338#L606-3 [2018-11-18 14:27:11,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:27:11,085 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-18 14:27:11,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:27:11,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:27:11,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:11,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:27:11,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:11,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:27:11,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:27:11,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:27:11,089 INFO L82 PathProgramCache]: Analyzing trace with hash 245249823, now seen corresponding path program 1 times [2018-11-18 14:27:11,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:27:11,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:27:11,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:11,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:27:11,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:11,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:27:11,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:27:11,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:27:11,127 INFO L82 PathProgramCache]: Analyzing trace with hash -2003304803, now seen corresponding path program 1 times [2018-11-18 14:27:11,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:27:11,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:27:11,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:11,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:27:11,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:11,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:27:11,534 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2018-11-18 14:27:11,804 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 14:27:11,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:27:11,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 14:27:12,588 WARN L180 SmtUtils]: Spent 770.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2018-11-18 14:27:12,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 14:27:12,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-18 14:27:12,655 INFO L87 Difference]: Start difference. First operand 1496 states and 1777 transitions. cyclomatic complexity: 284 Second operand 10 states. [2018-11-18 14:27:13,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:27:13,422 INFO L93 Difference]: Finished difference Result 1688 states and 1966 transitions. [2018-11-18 14:27:13,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 14:27:13,423 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1688 states and 1966 transitions. [2018-11-18 14:27:13,427 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1632 [2018-11-18 14:27:13,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1688 states to 1688 states and 1966 transitions. [2018-11-18 14:27:13,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1688 [2018-11-18 14:27:13,433 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1688 [2018-11-18 14:27:13,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1688 states and 1966 transitions. [2018-11-18 14:27:13,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 14:27:13,435 INFO L705 BuchiCegarLoop]: Abstraction has 1688 states and 1966 transitions. [2018-11-18 14:27:13,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states and 1966 transitions. [2018-11-18 14:27:13,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1546. [2018-11-18 14:27:13,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2018-11-18 14:27:13,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 1824 transitions. [2018-11-18 14:27:13,456 INFO L728 BuchiCegarLoop]: Abstraction has 1546 states and 1824 transitions. [2018-11-18 14:27:13,456 INFO L608 BuchiCegarLoop]: Abstraction has 1546 states and 1824 transitions. [2018-11-18 14:27:13,456 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 14:27:13,456 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1546 states and 1824 transitions. [2018-11-18 14:27:13,461 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1490 [2018-11-18 14:27:13,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:27:13,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:27:13,462 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:27:13,462 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:27:13,463 INFO L794 eck$LassoCheckResult]: Stem: 15663#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 15546#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 15547#L606-3 assume true; 16874#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16871#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; 16867#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); 16300#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; 15815#L597 [2018-11-18 14:27:13,463 INFO L796 eck$LassoCheckResult]: Loop: 15815#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 16276#L606-3 assume true; 16274#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16272#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; 16270#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); 16268#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 16266#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); 16264#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 16262#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; 15815#L597 [2018-11-18 14:27:13,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:27:13,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1805984299, now seen corresponding path program 1 times [2018-11-18 14:27:13,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:27:13,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:27:13,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:13,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:27:13,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:13,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:27:13,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:27:13,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:27:13,473 INFO L82 PathProgramCache]: Analyzing trace with hash -278812021, now seen corresponding path program 1 times [2018-11-18 14:27:13,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:27:13,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:27:13,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:13,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:27:13,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:13,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:27:13,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:27:13,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:27:13,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1569761375, now seen corresponding path program 1 times [2018-11-18 14:27:13,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:27:13,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:27:13,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:13,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:27:13,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:13,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:27:13,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:27:13,734 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 14:27:13,734 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 14:27:13,734 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 14:27:13,734 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 14:27:13,734 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 14:27:13,734 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:27:13,734 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 14:27:13,734 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 14:27:13,734 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label26_true-unreach-call_false-termination.c_Iteration8_Lasso [2018-11-18 14:27:13,734 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 14:27:13,735 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 14:27:13,736 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 14:27:13,785 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 14:27:13,787 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 14:27:13,789 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 14:27:13,791 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 14:27:13,797 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 14:27:13,802 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 14:27:13,805 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 14:27:13,806 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 14:27:13,809 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 14:27:13,810 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 14:27:13,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:27:13,815 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 14:27:13,817 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 14:27:13,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:27:13,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:27:13,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:27:13,837 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 14:27:13,843 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 14:27:13,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:27:13,848 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 14:27:14,089 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 14:27:14,089 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fccea397-e2f3-4697-ad4f-c02716ab6be5/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 14:27:14,092 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:27:14,092 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:27:14,094 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 14:27:14,094 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_fccea397-e2f3-4697-ad4f-c02716ab6be5/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 14:27:14,110 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:27:14,110 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:27:14,112 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 14:27:14,113 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_fccea397-e2f3-4697-ad4f-c02716ab6be5/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 14:27:14,130 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:27:14,130 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:27:14,132 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 14:27:14,132 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_fccea397-e2f3-4697-ad4f-c02716ab6be5/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 14:27:14,149 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:27:14,149 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:27:14,151 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 14:27:14,151 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_fccea397-e2f3-4697-ad4f-c02716ab6be5/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 14:27:14,167 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:27:14,167 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:27:14,170 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 14:27:14,170 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_fccea397-e2f3-4697-ad4f-c02716ab6be5/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 14:27:14,195 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:27:14,195 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:27:14,197 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 14:27:14,197 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_fccea397-e2f3-4697-ad4f-c02716ab6be5/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 14:27:14,213 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:27:14,213 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:27:14,217 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 14:27:14,217 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_fccea397-e2f3-4697-ad4f-c02716ab6be5/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 14:27:14,233 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:27:14,233 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:27:14,235 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 14:27:14,235 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_fccea397-e2f3-4697-ad4f-c02716ab6be5/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 14:27:14,262 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:27:14,262 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:27:14,265 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 14:27:14,265 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_fccea397-e2f3-4697-ad4f-c02716ab6be5/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 14:27:14,290 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:27:14,290 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:27:14,292 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 14:27:14,292 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_fccea397-e2f3-4697-ad4f-c02716ab6be5/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 14:27:14,310 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:27:14,310 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:27:14,313 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 14:27:14,313 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_fccea397-e2f3-4697-ad4f-c02716ab6be5/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 14:27:14,330 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:27:14,330 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:27:14,332 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 14:27:14,333 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_fccea397-e2f3-4697-ad4f-c02716ab6be5/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 14:27:14,358 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:27:14,358 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:27:14,361 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 14:27:14,361 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_fccea397-e2f3-4697-ad4f-c02716ab6be5/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 14:27:14,377 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:27:14,377 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:27:14,379 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 14:27:14,380 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_fccea397-e2f3-4697-ad4f-c02716ab6be5/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 14:27:14,396 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:27:14,396 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:27:14,398 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 14:27:14,398 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_fccea397-e2f3-4697-ad4f-c02716ab6be5/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 14:27:14,414 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:27:14,414 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fccea397-e2f3-4697-ad4f-c02716ab6be5/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 14:27:14,435 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 14:27:14,435 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:27:14,598 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 14:27:14,598 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_fccea397-e2f3-4697-ad4f-c02716ab6be5/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 14:27:14,613 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:27:14,614 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:27:14,616 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 14:27:14,616 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_fccea397-e2f3-4697-ad4f-c02716ab6be5/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 14:27:14,632 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:27:14,632 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fccea397-e2f3-4697-ad4f-c02716ab6be5/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 14:27:14,650 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 14:27:14,650 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:27:14,786 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 14:27:14,786 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_fccea397-e2f3-4697-ad4f-c02716ab6be5/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) [2018-11-18 14:27:14,803 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:27:14,803 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:27:14,814 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 14:27:14,814 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_fccea397-e2f3-4697-ad4f-c02716ab6be5/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 14:27:14,833 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:27:14,833 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:27:14,836 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 14:27:14,836 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_fccea397-e2f3-4697-ad4f-c02716ab6be5/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 14:27:14,854 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:27:14,854 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:27:14,856 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 14:27:14,856 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 14:27:14,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 02:27:14 BoogieIcfgContainer [2018-11-18 14:27:14,894 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 14:27:14,894 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 14:27:14,894 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 14:27:14,894 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 14:27:14,894 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:26:55" (3/4) ... [2018-11-18 14:27:14,897 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-18 14:27:14,945 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_fccea397-e2f3-4697-ad4f-c02716ab6be5/bin-2019/uautomizer/witness.graphml [2018-11-18 14:27:14,946 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 14:27:14,946 INFO L168 Benchmark]: Toolchain (without parser) took 22353.27 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 431.0 MB). Free memory was 956.9 MB in the beginning and 1.0 GB in the end (delta: -58.7 MB). Peak memory consumption was 372.2 MB. Max. memory is 11.5 GB. [2018-11-18 14:27:14,947 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 14:27:14,947 INFO L168 Benchmark]: CACSL2BoogieTranslator took 542.73 ms. Allocated memory is still 1.0 GB. Free memory was 956.9 MB in the beginning and 927.4 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-11-18 14:27:14,947 INFO L168 Benchmark]: Boogie Procedure Inliner took 193.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 927.4 MB in the beginning and 1.1 GB in the end (delta: -221.3 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. [2018-11-18 14:27:14,948 INFO L168 Benchmark]: Boogie Preprocessor took 80.85 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.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-18 14:27:14,948 INFO L168 Benchmark]: RCFGBuilder took 2085.08 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: 107.1 MB). Peak memory consumption was 107.1 MB. Max. memory is 11.5 GB. [2018-11-18 14:27:14,948 INFO L168 Benchmark]: BuchiAutomizer took 19391.35 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 271.1 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 22.4 MB). Peak memory consumption was 293.5 MB. Max. memory is 11.5 GB. [2018-11-18 14:27:14,948 INFO L168 Benchmark]: Witness Printer took 51.78 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 14:27:14,950 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 542.73 ms. Allocated memory is still 1.0 GB. Free memory was 956.9 MB in the beginning and 927.4 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 193.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 927.4 MB in the beginning and 1.1 GB in the end (delta: -221.3 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 80.85 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.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2085.08 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: 107.1 MB). Peak memory consumption was 107.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 19391.35 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 271.1 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 22.4 MB). Peak memory consumption was 293.5 MB. Max. memory is 11.5 GB. * Witness Printer took 51.78 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 19.3s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 9.2s. Construction of modules took 8.4s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 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, 3081 SDslu, 490 SDs, 0 SdLazy, 3703 SolverSat, 847 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.4s Time LassoAnalysisResults: nont1 unkn0 SFLI4 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital65 mio100 ax100 hnf103 lsp39 ukn90 mio100 lsp100 div100 bol100 ite100 ukn100 eq209 hnf93 smp100 dnf148 smp89 tf102 neg98 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 81ms 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@1bca1341=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@e22a134=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@1bca1341=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@e22a134=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@1bca1341=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@e22a134=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...