./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label15_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_d03a45a7-697f-48d5-986c-aacd3e913502/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d03a45a7-697f-48d5-986c-aacd3e913502/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d03a45a7-697f-48d5-986c-aacd3e913502/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d03a45a7-697f-48d5-986c-aacd3e913502/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label15_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d03a45a7-697f-48d5-986c-aacd3e913502/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d03a45a7-697f-48d5-986c-aacd3e913502/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 a36e59b73de737948c8406f65f182e859a67435b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 09:50:28,044 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 09:50:28,045 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 09:50:28,054 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 09:50:28,054 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 09:50:28,055 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 09:50:28,055 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 09:50:28,057 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 09:50:28,058 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 09:50:28,058 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 09:50:28,059 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 09:50:28,059 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 09:50:28,060 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 09:50:28,061 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 09:50:28,061 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 09:50:28,062 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 09:50:28,063 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 09:50:28,064 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 09:50:28,065 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 09:50:28,067 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 09:50:28,067 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 09:50:28,068 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 09:50:28,070 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 09:50:28,070 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 09:50:28,071 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 09:50:28,071 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 09:50:28,072 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 09:50:28,073 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 09:50:28,073 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 09:50:28,074 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 09:50:28,074 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 09:50:28,075 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 09:50:28,075 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 09:50:28,075 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 09:50:28,076 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 09:50:28,076 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 09:50:28,076 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d03a45a7-697f-48d5-986c-aacd3e913502/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 09:50:28,087 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 09:50:28,087 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 09:50:28,088 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 09:50:28,088 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 09:50:28,089 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 09:50:28,089 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 09:50:28,089 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 09:50:28,089 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 09:50:28,089 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 09:50:28,089 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 09:50:28,089 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 09:50:28,089 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 09:50:28,089 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 09:50:28,090 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 09:50:28,090 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 09:50:28,090 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 09:50:28,090 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 09:50:28,090 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 09:50:28,090 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 09:50:28,090 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 09:50:28,090 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 09:50:28,091 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 09:50:28,091 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 09:50:28,091 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 09:50:28,091 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 09:50:28,091 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 09:50:28,091 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 09:50:28,091 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 09:50:28,091 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 09:50:28,091 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 09:50:28,091 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 09:50:28,092 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 09:50:28,092 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_d03a45a7-697f-48d5-986c-aacd3e913502/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 -> a36e59b73de737948c8406f65f182e859a67435b [2018-11-18 09:50:28,113 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 09:50:28,121 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 09:50:28,123 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 09:50:28,124 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 09:50:28,124 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 09:50:28,124 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d03a45a7-697f-48d5-986c-aacd3e913502/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label15_true-unreach-call_false-termination.c [2018-11-18 09:50:28,162 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d03a45a7-697f-48d5-986c-aacd3e913502/bin-2019/uautomizer/data/2ee437a20/f74946a0e9a6452999e58501da950616/FLAG0aa255091 [2018-11-18 09:50:28,571 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 09:50:28,572 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d03a45a7-697f-48d5-986c-aacd3e913502/sv-benchmarks/c/eca-rers2012/Problem02_label15_true-unreach-call_false-termination.c [2018-11-18 09:50:28,580 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d03a45a7-697f-48d5-986c-aacd3e913502/bin-2019/uautomizer/data/2ee437a20/f74946a0e9a6452999e58501da950616/FLAG0aa255091 [2018-11-18 09:50:28,927 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d03a45a7-697f-48d5-986c-aacd3e913502/bin-2019/uautomizer/data/2ee437a20/f74946a0e9a6452999e58501da950616 [2018-11-18 09:50:28,930 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 09:50:28,931 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 09:50:28,931 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 09:50:28,931 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 09:50:28,934 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 09:50:28,934 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:50:28" (1/1) ... [2018-11-18 09:50:28,936 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@269ec442 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:28, skipping insertion in model container [2018-11-18 09:50:28,936 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:50:28" (1/1) ... [2018-11-18 09:50:28,943 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 09:50:28,978 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 09:50:29,231 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:50:29,236 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 09:50:29,309 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:50:29,319 INFO L195 MainTranslator]: Completed translation [2018-11-18 09:50:29,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:29 WrapperNode [2018-11-18 09:50:29,320 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 09:50:29,320 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 09:50:29,320 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 09:50:29,320 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 09:50:29,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:29" (1/1) ... [2018-11-18 09:50:29,391 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:29" (1/1) ... [2018-11-18 09:50:29,431 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 09:50:29,432 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 09:50:29,432 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 09:50:29,432 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 09:50:29,444 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:29" (1/1) ... [2018-11-18 09:50:29,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:29" (1/1) ... [2018-11-18 09:50:29,447 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:29" (1/1) ... [2018-11-18 09:50:29,447 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:29" (1/1) ... [2018-11-18 09:50:29,463 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:29" (1/1) ... [2018-11-18 09:50:29,472 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:29" (1/1) ... [2018-11-18 09:50:29,476 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:29" (1/1) ... [2018-11-18 09:50:29,480 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 09:50:29,480 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 09:50:29,480 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 09:50:29,480 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 09:50:29,482 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d03a45a7-697f-48d5-986c-aacd3e913502/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:50:29,542 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 09:50:29,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 09:50:29,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 09:50:30,509 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 09:50:30,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:50:30 BoogieIcfgContainer [2018-11-18 09:50:30,510 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 09:50:30,511 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 09:50:30,511 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 09:50:30,514 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 09:50:30,515 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 09:50:30,515 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 09:50:28" (1/3) ... [2018-11-18 09:50:30,516 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@608a924d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 09:50:30, skipping insertion in model container [2018-11-18 09:50:30,516 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 09:50:30,516 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:29" (2/3) ... [2018-11-18 09:50:30,517 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@608a924d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 09:50:30, skipping insertion in model container [2018-11-18 09:50:30,517 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 09:50:30,517 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:50:30" (3/3) ... [2018-11-18 09:50:30,519 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label15_true-unreach-call_false-termination.c [2018-11-18 09:50:30,567 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 09:50:30,567 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 09:50:30,567 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 09:50:30,567 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 09:50:30,568 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 09:50:30,568 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 09:50:30,568 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 09:50:30,568 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 09:50:30,568 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 09:50:30,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-18 09:50:30,617 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-18 09:50:30,617 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:50:30,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:50:30,626 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 09:50:30,626 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 09:50:30,626 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 09:50:30,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-18 09:50:30,633 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-18 09:50:30,633 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:50:30,634 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:50:30,634 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 09:50:30,635 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 09:50:30,642 INFO L794 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 167#L606-3true [2018-11-18 09:50:30,643 INFO L796 eck$LassoCheckResult]: Loop: 167#L606-3true assume true; 163#L606-1true assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 65#L611true assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 192#L30true assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 207#L597true main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 167#L606-3true [2018-11-18 09:50:30,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:50:30,649 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 09:50:30,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:50:30,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:50:30,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:50:30,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:50:30,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:50:30,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:50:30,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:50:30,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:50:30,753 INFO L82 PathProgramCache]: Analyzing trace with hash 34545679, now seen corresponding path program 1 times [2018-11-18 09:50:30,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:50:30,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:50:30,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:50:30,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:50:30,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:50:30,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:50:30,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:50:30,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:50:30,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1805985165, now seen corresponding path program 1 times [2018-11-18 09:50:30,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:50:30,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:50:30,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:50:30,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:50:30,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:50:30,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:50:30,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:50:30,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:50:30,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 09:50:30,969 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:50:30,970 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:50:30,970 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:50:30,970 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:50:30,970 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 09:50:30,971 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:50:30,971 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:50:30,971 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:50:30,971 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label15_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-18 09:50:30,971 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:50:30,972 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:50:30,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:50:30,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:50:31,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:50:31,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:50:31,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:50:31,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:50:31,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:50:31,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:50:31,222 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:50:31,223 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d03a45a7-697f-48d5-986c-aacd3e913502/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:50:31,227 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:50:31,227 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:50:31,248 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:50:31,248 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_d03a45a7-697f-48d5-986c-aacd3e913502/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:50:31,270 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:50:31,271 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:50:31,286 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:50:31,286 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_d03a45a7-697f-48d5-986c-aacd3e913502/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:50:31,311 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:50:31,311 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:50:31,317 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:50:31,317 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_d03a45a7-697f-48d5-986c-aacd3e913502/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:50:31,342 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:50:31,342 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:50:31,357 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:50:31,358 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_d03a45a7-697f-48d5-986c-aacd3e913502/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-18 09:50:31,394 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:50:31,394 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:50:31,405 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:50:31,405 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_d03a45a7-697f-48d5-986c-aacd3e913502/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 09:50:31,441 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:50:31,441 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:50:31,444 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:50:31,444 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_d03a45a7-697f-48d5-986c-aacd3e913502/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 09:50:31,480 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:50:31,480 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:50:31,486 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:50:31,486 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_d03a45a7-697f-48d5-986c-aacd3e913502/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:50:31,513 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:50:31,513 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d03a45a7-697f-48d5-986c-aacd3e913502/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:50:31,546 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 09:50:31,546 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:50:31,581 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 09:50:31,583 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:50:31,583 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:50:31,583 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:50:31,583 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:50:31,583 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 09:50:31,583 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:50:31,583 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:50:31,584 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:50:31,584 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label15_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-18 09:50:31,584 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:50:31,584 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:50:31,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:50:31,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:50:31,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:50:31,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:50:31,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:50:31,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:50:31,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:50:31,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:50:31,817 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:50:31,821 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 09:50:31,822 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:31,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:31,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:31,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:31,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:31,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:50:31,826 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:50:31,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:31,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:31,835 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:31,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:31,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:31,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:31,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:31,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:50:31,837 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:50:31,837 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:31,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:31,840 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:31,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:31,840 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:31,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:31,840 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 09:50:31,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:50:31,842 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:50:31,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:31,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:31,863 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:31,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:31,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:31,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:31,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:31,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:50:31,865 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:50:31,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:31,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:31,869 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:31,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:31,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:31,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:31,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:31,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:50:31,871 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:50:31,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:31,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:31,873 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:31,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:31,874 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:31,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:31,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:31,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:50:31,874 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:50:31,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:31,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:31,877 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:31,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:31,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:31,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:31,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:31,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:50:31,878 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:50:31,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:31,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:31,880 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:31,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:31,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:31,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:31,881 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:50:31,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:50:31,881 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:50:31,882 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:31,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:31,887 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-18 09:50:31,887 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:31,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:31,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:31,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:31,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:31,888 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:50:31,889 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:50:31,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:31,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:31,898 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:31,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:31,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:31,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:31,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:31,899 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:50:31,899 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:50:31,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:31,902 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:31,903 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:31,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:31,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:31,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:31,904 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 09:50:31,904 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:50:31,906 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 09:50:31,906 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:31,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:31,925 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:31,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:31,925 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:31,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:31,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:31,926 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:50:31,927 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:50:31,927 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:31,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:31,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:31,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:31,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:31,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:31,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:31,933 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:50:31,933 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:50:31,933 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:31,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:31,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 09:50:31,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:31,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:31,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:31,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:31,937 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:50:31,937 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:50:31,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:31,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:31,940 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:31,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:31,941 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:31,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:31,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:31,941 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:50:31,942 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:50:31,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:31,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:31,943 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:31,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:31,943 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:31,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:31,944 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:50:31,944 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:50:31,945 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:50:31,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:31,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:31,950 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-18 09:50:31,950 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:31,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:31,951 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:31,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:31,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:31,951 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:50:31,952 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:50:31,953 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:31,960 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:31,960 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:31,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:31,961 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:31,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:31,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:31,961 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:50:31,962 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:50:31,962 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:31,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:31,965 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:31,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:31,965 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:31,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:31,965 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 09:50:31,966 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:50:31,968 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 09:50:31,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:31,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:31,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:31,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:31,984 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:31,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:31,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:31,985 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:50:31,985 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:50:31,986 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:31,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:31,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 09:50:31,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:31,990 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:31,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:31,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:31,990 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:50:31,991 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:50:31,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:31,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:31,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:31,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:31,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:31,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:31,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:31,994 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:50:31,994 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:50:31,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:31,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:31,997 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:31,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:31,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:31,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:31,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:31,998 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:50:31,998 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:50:31,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:31,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:31,999 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:31,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:32,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:32,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:32,000 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:50:32,000 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:50:32,001 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:50:32,001 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:32,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:32,006 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-18 09:50:32,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:32,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:32,007 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:32,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:32,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:32,007 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:50:32,008 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:50:32,008 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:32,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:32,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 09:50:32,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:32,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:32,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:32,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:32,016 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:50:32,017 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:50:32,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:32,019 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:32,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 09:50:32,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:32,020 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:32,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:32,020 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 09:50:32,020 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:50:32,022 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 09:50:32,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:32,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:32,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 09:50:32,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:32,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:32,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:32,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:32,038 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:50:32,039 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:50:32,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:32,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:32,043 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:32,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:32,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:32,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:32,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:32,044 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:50:32,044 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:50:32,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:32,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:32,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 09:50:32,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:32,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:32,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:32,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:32,047 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:50:32,048 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:50:32,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:32,050 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:32,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 09:50:32,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:32,051 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:32,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:32,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:32,051 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:50:32,051 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:50:32,052 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:32,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:32,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:32,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:32,053 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:32,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:32,054 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:50:32,054 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:50:32,054 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 09:50:32,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:32,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:32,059 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-18 09:50:32,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:32,060 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:32,060 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:50:32,060 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:32,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:32,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:32,060 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:50:32,061 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:50:32,062 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:32,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:32,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 09:50:32,075 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:32,075 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:50:32,075 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:32,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:32,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:32,075 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:50:32,076 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:50:32,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:32,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:32,079 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:32,079 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:32,079 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:50:32,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:32,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:32,080 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 09:50:32,080 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:50:32,082 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 09:50:32,082 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:32,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:32,108 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:32,108 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:32,108 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:50:32,108 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:32,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:32,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:32,109 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:50:32,110 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:50:32,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:32,113 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:32,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 09:50:32,114 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:32,114 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:50:32,114 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:32,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:32,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:32,115 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:50:32,115 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:50:32,115 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:32,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:32,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:32,118 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:32,118 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:50:32,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:32,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:32,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:32,119 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:50:32,119 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:50:32,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:32,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:32,122 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:32,122 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:32,122 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:50:32,122 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:32,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:32,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:32,123 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:50:32,123 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:50:32,123 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:32,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:32,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:32,124 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:32,125 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:50:32,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:32,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:32,125 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:50:32,125 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:50:32,126 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:50:32,126 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:32,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:32,131 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-18 09:50:32,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:32,132 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:32,132 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 09:50:32,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:32,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:32,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:32,132 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:50:32,134 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:50:32,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:32,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:32,144 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:32,145 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:32,145 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 09:50:32,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:32,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:32,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:32,145 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:50:32,146 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:50:32,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:32,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:32,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:32,149 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:32,149 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 09:50:32,150 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:32,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:32,150 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 09:50:32,150 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:50:32,153 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 09:50:32,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:32,176 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:32,176 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:32,177 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:32,177 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 09:50:32,177 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:32,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:32,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:32,177 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:50:32,178 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:50:32,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:32,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:32,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:32,183 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:32,183 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 09:50:32,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:32,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:32,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:32,183 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:50:32,184 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:50:32,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:32,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:32,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 09:50:32,188 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:32,188 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 09:50:32,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:32,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:32,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:32,188 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:50:32,189 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:50:32,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:32,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:32,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 09:50:32,192 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:32,192 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 09:50:32,192 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:32,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:32,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:32,193 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:50:32,193 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:50:32,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:32,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:32,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:32,195 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:32,195 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 09:50:32,195 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:32,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:32,196 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:50:32,196 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:50:32,198 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:50:32,198 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:32,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:32,203 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-18 09:50:32,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:32,204 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:32,204 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:50:32,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:32,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:32,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:32,204 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:50:32,206 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:50:32,207 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:32,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:32,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:32,214 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:32,214 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:50:32,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:32,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:32,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:32,215 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:50:32,216 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:50:32,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:32,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:32,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:32,220 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:32,220 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:50:32,220 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:32,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:32,221 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 09:50:32,221 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:50:32,224 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 09:50:32,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:32,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:32,251 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:32,252 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:32,252 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:50:32,252 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:32,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:32,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:32,252 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:50:32,254 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:50:32,254 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:32,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:32,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:32,259 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:32,259 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:50:32,259 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:32,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:32,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:32,259 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:50:32,260 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:50:32,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:32,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:32,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 09:50:32,264 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:32,264 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:50:32,264 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:32,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:32,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:32,265 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:50:32,266 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:50:32,266 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:32,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:32,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:32,270 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:32,270 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:50:32,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:32,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:32,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:32,271 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:50:32,271 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:50:32,272 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:32,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:32,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 09:50:32,273 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:32,273 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:50:32,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:32,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:32,273 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:50:32,273 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:50:32,275 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 09:50:32,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:32,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:32,282 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-18 09:50:32,282 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:32,282 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:32,282 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:50:32,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:32,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:32,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:32,283 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:50:32,284 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:50:32,284 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:32,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:32,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:32,291 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:32,291 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:50:32,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:32,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:32,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:32,292 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:50:32,292 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:50:32,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:32,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:32,294 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:32,295 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:32,295 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:50:32,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:32,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:32,295 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 09:50:32,295 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:50:32,296 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 09:50:32,297 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:32,309 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:32,309 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:32,310 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:32,310 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:50:32,310 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:32,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:32,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:32,310 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:50:32,311 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:50:32,311 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:32,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:32,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:32,315 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:32,316 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:50:32,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:32,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:32,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:32,316 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:50:32,316 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:50:32,316 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:32,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:32,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:32,319 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:32,319 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:50:32,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:32,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:32,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:32,319 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:50:32,320 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:50:32,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:32,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:32,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:32,322 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:32,322 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:50:32,322 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:32,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:32,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:32,323 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:50:32,323 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:50:32,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:32,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:32,325 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:32,325 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:32,325 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:50:32,325 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:32,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:32,325 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:50:32,325 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:50:32,326 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:50:32,326 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:32,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:32,332 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-18 09:50:32,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:32,333 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:32,333 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:50:32,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:32,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:32,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:32,333 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 09:50:32,335 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:50:32,335 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:32,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:32,356 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:32,356 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:32,356 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:50:32,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:32,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:32,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:32,357 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 09:50:32,357 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:50:32,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:32,360 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:32,360 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:32,361 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:32,361 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:50:32,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:32,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:32,361 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 09:50:32,361 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 09:50:32,364 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-18 09:50:32,364 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:32,418 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:32,418 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:32,419 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:32,419 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:50:32,419 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:32,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:32,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:32,419 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 09:50:32,420 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:50:32,420 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:32,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:32,429 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:32,430 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:32,430 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:50:32,430 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:32,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:32,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:32,430 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 09:50:32,431 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:50:32,431 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:32,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:32,434 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:32,435 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:32,435 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:50:32,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:32,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:32,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:32,435 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 09:50:32,436 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:50:32,436 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:32,439 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:32,439 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:32,439 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:32,440 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:50:32,440 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:32,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:32,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:32,440 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 09:50:32,441 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:50:32,441 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:32,443 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:32,444 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:32,444 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:32,444 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:50:32,444 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:32,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:32,445 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:50:32,445 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 09:50:32,446 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 09:50:32,446 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:32,452 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:32,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:50:32,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:50:32,463 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 3 states. [2018-11-18 09:50:33,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:50:33,066 INFO L93 Difference]: Finished difference Result 381 states and 548 transitions. [2018-11-18 09:50:33,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:50:33,069 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 381 states and 548 transitions. [2018-11-18 09:50:33,073 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 372 [2018-11-18 09:50:33,079 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 381 states to 374 states and 541 transitions. [2018-11-18 09:50:33,080 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 374 [2018-11-18 09:50:33,081 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 374 [2018-11-18 09:50:33,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 374 states and 541 transitions. [2018-11-18 09:50:33,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 09:50:33,084 INFO L705 BuchiCegarLoop]: Abstraction has 374 states and 541 transitions. [2018-11-18 09:50:33,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states and 541 transitions. [2018-11-18 09:50:33,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2018-11-18 09:50:33,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-11-18 09:50:33,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 539 transitions. [2018-11-18 09:50:33,120 INFO L728 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-18 09:50:33,120 INFO L608 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-18 09:50:33,120 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 09:50:33,121 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 373 states and 539 transitions. [2018-11-18 09:50:33,123 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 371 [2018-11-18 09:50:33,123 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:50:33,123 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:50:33,123 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 09:50:33,123 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:50:33,123 INFO L794 eck$LassoCheckResult]: Stem: 752#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 631#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 632#L606-3 [2018-11-18 09:50:33,124 INFO L796 eck$LassoCheckResult]: Loop: 632#L606-3 assume true; 957#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 955#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; 953#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); 951#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 949#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); 948#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 946#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); 945#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 944#L54 assume (((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0);~a28~0 := 7;~a11~0 := 1;~a25~0 := 0;calculate_output_#res := -1; 634#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 632#L606-3 [2018-11-18 09:50:33,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:50:33,124 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-18 09:50:33,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:50:33,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:50:33,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:50:33,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:50:33,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:50:33,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:50:33,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:50:33,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:50:33,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1956321088, now seen corresponding path program 1 times [2018-11-18 09:50:33,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:50:33,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:50:33,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:50:33,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:50:33,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:50:33,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:50:33,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:50:33,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:50:33,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1962170302, now seen corresponding path program 1 times [2018-11-18 09:50:33,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:50:33,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:50:33,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:50:33,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:50:33,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:50:33,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:50:33,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:50:33,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:50:33,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 09:50:33,268 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:50:33,268 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:50:33,268 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:50:33,269 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:50:33,269 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 09:50:33,269 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:50:33,269 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:50:33,269 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:50:33,269 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label15_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-18 09:50:33,269 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:50:33,269 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:50:33,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:50:33,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:50:33,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:50:33,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:50:33,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:50:33,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:50:33,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:50:33,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:50:33,411 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:50:33,411 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d03a45a7-697f-48d5-986c-aacd3e913502/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:50:33,417 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:50:33,417 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:50:33,425 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:50:33,425 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_d03a45a7-697f-48d5-986c-aacd3e913502/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:50:33,447 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:50:33,447 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:50:33,449 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:50:33,450 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_d03a45a7-697f-48d5-986c-aacd3e913502/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:50:33,466 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:50:33,466 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:50:33,469 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:50:33,469 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_d03a45a7-697f-48d5-986c-aacd3e913502/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:50:33,486 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:50:33,486 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:50:33,488 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:50:33,488 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_d03a45a7-697f-48d5-986c-aacd3e913502/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:50:33,505 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:50:33,505 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:50:33,518 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:50:33,518 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_d03a45a7-697f-48d5-986c-aacd3e913502/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:50:33,542 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:50:33,543 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d03a45a7-697f-48d5-986c-aacd3e913502/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:50:33,569 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 09:50:33,569 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:50:33,600 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 09:50:33,601 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:50:33,601 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:50:33,601 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:50:33,601 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:50:33,601 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 09:50:33,601 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:50:33,601 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:50:33,602 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:50:33,602 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label15_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-18 09:50:33,602 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:50:33,602 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:50:33,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:50:33,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:50:33,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:50:33,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:50:33,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:50:33,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:50:33,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 09:50:33,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:50:33,716 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:50:33,716 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 09:50:33,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:33,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:33,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:50:33,718 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:50:33,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:33,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:33,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:50:33,720 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:50:33,720 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:33,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,722 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:50:33,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:50:33,722 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:50:33,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:33,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:33,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:50:33,723 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:50:33,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:33,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:33,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:50:33,725 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:50:33,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:33,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,726 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:50:33,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:50:33,727 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:50:33,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:33,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,729 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:50:33,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:50:33,729 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:50:33,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:33,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:33,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:50:33,732 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:50:33,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,734 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-18 09:50:33,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:33,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:33,735 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:50:33,735 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:50:33,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,736 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:33,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:33,737 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:50:33,737 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:50:33,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:33,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,739 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:50:33,739 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:50:33,740 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:50:33,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:33,741 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:33,741 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:50:33,741 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:50:33,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:33,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:33,743 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:50:33,743 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:50:33,743 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:33,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,745 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:50:33,745 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:50:33,745 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:50:33,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:33,747 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,748 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:50:33,748 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:50:33,748 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:50:33,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:33,752 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:33,752 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:50:33,753 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:50:33,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,755 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-18 09:50:33,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:33,755 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:33,756 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:50:33,756 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:50:33,756 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,757 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:33,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:33,758 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:50:33,758 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:50:33,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,760 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:33,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,761 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:50:33,761 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:50:33,761 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:50:33,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:33,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:33,763 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:50:33,763 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:50:33,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,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 09:50:33,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:33,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:33,764 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:50:33,764 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:50:33,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:33,766 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,766 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:50:33,766 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:50:33,766 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:50:33,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:33,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,770 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:50:33,770 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:50:33,770 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:50:33,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:33,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:33,775 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:50:33,775 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:50:33,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,778 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-18 09:50:33,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:33,779 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:33,779 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:50:33,780 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:50:33,780 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:33,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:33,782 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:50:33,782 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:50:33,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:33,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,785 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:50:33,785 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:50:33,786 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 09:50:33,786 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,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 09:50:33,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:33,787 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:33,787 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:50:33,787 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:50:33,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:33,788 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:33,789 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:50:33,789 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:50:33,789 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,790 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:33,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,791 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:50:33,791 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:50:33,792 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 09:50:33,792 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:33,795 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,795 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:50:33,795 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:50:33,796 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 09:50:33,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,800 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:50:33,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:33,801 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:50:33,801 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:50:33,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,804 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-18 09:50:33,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,805 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:33,805 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:50:33,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:33,806 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:50:33,806 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:50:33,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,808 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,808 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,808 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:33,808 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:50:33,808 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:33,809 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:50:33,809 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:50:33,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,812 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,812 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:33,812 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:50:33,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,813 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:50:33,813 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:50:33,813 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:50:33,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,815 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:33,815 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:50:33,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:33,815 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:50:33,815 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:50:33,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,816 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:33,816 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:50:33,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:33,817 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:50:33,817 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:50:33,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,819 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:33,819 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:50:33,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,820 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:50:33,820 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:50:33,820 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:50:33,820 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,824 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,824 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:33,824 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:50:33,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,825 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:50:33,825 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:50:33,826 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:50:33,826 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,832 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,832 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:33,832 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:50:33,832 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:33,833 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:50:33,833 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:50:33,833 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,837 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-18 09:50:33,837 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,838 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:33,838 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 09:50:33,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:33,838 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:50:33,839 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:50:33,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,842 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:33,842 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 09:50:33,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:33,842 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:50:33,843 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:50:33,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,847 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:33,847 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 09:50:33,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,847 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:50:33,847 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:50:33,848 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:50:33,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,849 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,850 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:33,850 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 09:50:33,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:33,850 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:50:33,851 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:50:33,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,852 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:33,852 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 09:50:33,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:33,853 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:50:33,853 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:50:33,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,856 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:33,856 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 09:50:33,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,857 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:50:33,857 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:50:33,858 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:50:33,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,863 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,864 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:33,864 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 09:50:33,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,864 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:50:33,864 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:50:33,866 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:50:33,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,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 09:50:33,877 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:33,877 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 09:50:33,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:33,877 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:50:33,878 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:50:33,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,884 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-18 09:50:33,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,885 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:33,885 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:50:33,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:33,885 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:50:33,886 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:50:33,886 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,891 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:33,891 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:50:33,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:33,891 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:50:33,892 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:50:33,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,898 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,899 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:33,899 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:50:33,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,899 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:50:33,899 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:50:33,909 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 09:50:33,909 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,910 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,910 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:33,910 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:50:33,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:33,911 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:50:33,912 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:50:33,912 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,913 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,913 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:33,913 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:50:33,913 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:33,914 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:50:33,915 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:50:33,915 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,919 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:33,920 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:50:33,920 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,920 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:50:33,920 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:50:33,922 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 09:50:33,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,932 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,932 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:33,932 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:50:33,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,933 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:50:33,933 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:50:33,935 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 09:50:33,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,954 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,955 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,955 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:33,956 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:50:33,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:33,956 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:50:33,958 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:50:33,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,969 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-18 09:50:33,969 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,970 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:33,970 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:50:33,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:33,970 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:50:33,971 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:50:33,971 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,973 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,973 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:33,973 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:50:33,974 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:33,974 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:50:33,974 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:50:33,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,978 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,978 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,978 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:33,978 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:50:33,978 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,979 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:50:33,979 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:50:33,979 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:50:33,979 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,981 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,981 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,981 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:33,981 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:50:33,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:33,982 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:50:33,982 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:50:33,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,983 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,984 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:33,984 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:50:33,984 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:33,984 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:50:33,984 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:50:33,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,986 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:33,987 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:33,987 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:50:33,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,987 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:50:33,987 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:50:33,988 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:50:33,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:33,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:33,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 09:50:33,992 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:33,992 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:50:33,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:33,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:33,993 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:50:33,993 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:50:33,993 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:50:33,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:34,039 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:34,039 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:34,040 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:34,040 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:50:34,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:34,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:34,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:34,040 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:50:34,041 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:50:34,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:34,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:34,046 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-18 09:50:34,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 09:50:34,047 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:34,047 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:50:34,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:34,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:34,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:34,048 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 09:50:34,048 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:50:34,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:34,050 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:34,051 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:34,051 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:34,051 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:50:34,051 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:34,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:34,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:34,052 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 09:50:34,052 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:50:34,052 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:34,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:34,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:34,059 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:34,059 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:50:34,059 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:34,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:34,060 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:50:34,060 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 09:50:34,060 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 09:50:34,060 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:34,062 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:34,062 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:34,063 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:34,063 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:50:34,063 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:34,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:34,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:34,063 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 09:50:34,064 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:50:34,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:34,066 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:34,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 09:50:34,066 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:34,066 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:50:34,066 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:34,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:34,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:34,067 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 09:50:34,067 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:50:34,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:34,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:34,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 09:50:34,070 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:34,070 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:50:34,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:34,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:34,070 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:50:34,071 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 09:50:34,071 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 09:50:34,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:34,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:34,079 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:34,079 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:34,079 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:50:34,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:34,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:34,080 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:50:34,080 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 09:50:34,081 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 09:50:34,081 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:34,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:34,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:50:34,102 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:50:34,102 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:50:34,102 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:50:34,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:50:34,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:50:34,102 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 09:50:34,104 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:50:34,104 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:50:34,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:50:34,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:50:34,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:50:34,124 INFO L87 Difference]: Start difference. First operand 373 states and 539 transitions. cyclomatic complexity: 167 Second operand 3 states. [2018-11-18 09:50:34,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:50:34,552 INFO L93 Difference]: Finished difference Result 660 states and 919 transitions. [2018-11-18 09:50:34,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:50:34,552 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 660 states and 919 transitions. [2018-11-18 09:50:34,557 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-18 09:50:34,560 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 660 states to 660 states and 919 transitions. [2018-11-18 09:50:34,561 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 660 [2018-11-18 09:50:34,562 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 660 [2018-11-18 09:50:34,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 660 states and 919 transitions. [2018-11-18 09:50:34,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 09:50:34,564 INFO L705 BuchiCegarLoop]: Abstraction has 660 states and 919 transitions. [2018-11-18 09:50:34,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states and 919 transitions. [2018-11-18 09:50:34,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2018-11-18 09:50:34,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2018-11-18 09:50:34,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 919 transitions. [2018-11-18 09:50:34,584 INFO L728 BuchiCegarLoop]: Abstraction has 660 states and 919 transitions. [2018-11-18 09:50:34,584 INFO L608 BuchiCegarLoop]: Abstraction has 660 states and 919 transitions. [2018-11-18 09:50:34,584 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 09:50:34,584 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 660 states and 919 transitions. [2018-11-18 09:50:34,588 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-18 09:50:34,588 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:50:34,588 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:50:34,589 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 09:50:34,589 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:50:34,589 INFO L794 eck$LassoCheckResult]: Stem: 1798#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 1672#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 1673#L606-3 [2018-11-18 09:50:34,590 INFO L796 eck$LassoCheckResult]: Loop: 1673#L606-3 assume true; 1918#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 2313#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; 2312#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); 2311#L35 assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res := 22; 1685#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 2288#L606-3 assume true; 2241#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 2237#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; 2236#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); 1976#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 1977#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); 2193#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 2191#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); 2190#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 2189#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)); 2186#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); 2185#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); 2184#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); 2183#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 2181#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); 2179#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 2177#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 2175#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 2173#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); 2171#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); 2169#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 2167#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); 2165#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 2143#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 2144#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); 2160#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 2159#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); 2156#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); 2152#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 2153#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 2163#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 2146#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 2147#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); 2203#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 2202#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 2201#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 2200#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); 2199#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 2132#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 2130#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); 2131#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 2182#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); 2180#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); 2178#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 2176#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); 2174#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 2172#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 2170#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)); 2168#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); 2166#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; 1821#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1673#L606-3 [2018-11-18 09:50:34,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:50:34,591 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-18 09:50:34,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:50:34,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:50:34,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:50:34,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:50:34,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:50:34,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:50:34,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:50:34,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:50:34,610 INFO L82 PathProgramCache]: Analyzing trace with hash 692590236, now seen corresponding path program 1 times [2018-11-18 09:50:34,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:50:34,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:50:34,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:50:34,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:50:34,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:50:34,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:50:34,687 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:50:34,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:50:34,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:50:34,688 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 09:50:34,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:50:34,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:50:34,688 INFO L87 Difference]: Start difference. First operand 660 states and 919 transitions. cyclomatic complexity: 260 Second operand 4 states. [2018-11-18 09:50:35,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:50:35,370 INFO L93 Difference]: Finished difference Result 1228 states and 1700 transitions. [2018-11-18 09:50:35,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:50:35,371 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1228 states and 1700 transitions. [2018-11-18 09:50:35,378 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1224 [2018-11-18 09:50:35,383 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1228 states to 1228 states and 1700 transitions. [2018-11-18 09:50:35,384 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1228 [2018-11-18 09:50:35,385 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1228 [2018-11-18 09:50:35,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1228 states and 1700 transitions. [2018-11-18 09:50:35,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 09:50:35,387 INFO L705 BuchiCegarLoop]: Abstraction has 1228 states and 1700 transitions. [2018-11-18 09:50:35,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states and 1700 transitions. [2018-11-18 09:50:35,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1225. [2018-11-18 09:50:35,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2018-11-18 09:50:35,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1694 transitions. [2018-11-18 09:50:35,404 INFO L728 BuchiCegarLoop]: Abstraction has 1225 states and 1694 transitions. [2018-11-18 09:50:35,404 INFO L608 BuchiCegarLoop]: Abstraction has 1225 states and 1694 transitions. [2018-11-18 09:50:35,404 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 09:50:35,404 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1225 states and 1694 transitions. [2018-11-18 09:50:35,409 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1221 [2018-11-18 09:50:35,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:50:35,409 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:50:35,411 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 09:50:35,411 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:50:35,411 INFO L794 eck$LassoCheckResult]: Stem: 3692#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 3567#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 3568#L606-3 [2018-11-18 09:50:35,411 INFO L796 eck$LassoCheckResult]: Loop: 3568#L606-3 assume true; 4706#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4705#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; 4704#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); 4703#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 4694#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); 4693#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 4691#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); 4692#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; 3581#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3816#L606-3 assume true; 3812#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3672#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; 3673#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; 3671#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4741#L606-3 assume true; 4740#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4739#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; 4737#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); 4735#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 4733#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); 3631#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3632#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); 3805#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 3569#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 3570#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 4731#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); 4729#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); 4727#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 4726#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); 3828#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 3768#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 3769#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 4328#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); 3831#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); 3639#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 3640#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); 3641#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 3642#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 3774#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); 3666#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 3667#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); 3668#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); 3669#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 4186#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 4497#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 4372#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 4373#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); 4657#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 4655#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 4653#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 4651#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); 4649#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 4648#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 4646#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); 4644#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 4642#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); 4640#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); 4638#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 4636#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); 4634#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 4632#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 4496#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)); 4410#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); 4405#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; 4082#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3568#L606-3 [2018-11-18 09:50:35,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:50:35,411 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-18 09:50:35,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:50:35,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:50:35,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:50:35,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:50:35,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:50:35,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:50:35,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:50:35,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:50:35,416 INFO L82 PathProgramCache]: Analyzing trace with hash 676565178, now seen corresponding path program 1 times [2018-11-18 09:50:35,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:50:35,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:50:35,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:50:35,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:50:35,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:50:35,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:50:35,453 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 09:50:35,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:50:35,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:50:35,454 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 09:50:35,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:50:35,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:50:35,454 INFO L87 Difference]: Start difference. First operand 1225 states and 1694 transitions. cyclomatic complexity: 471 Second operand 3 states. [2018-11-18 09:50:35,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:50:35,827 INFO L93 Difference]: Finished difference Result 1509 states and 2003 transitions. [2018-11-18 09:50:35,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:50:35,829 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1509 states and 2003 transitions. [2018-11-18 09:50:35,836 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1505 [2018-11-18 09:50:35,842 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1509 states to 1509 states and 2003 transitions. [2018-11-18 09:50:35,842 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1509 [2018-11-18 09:50:35,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1509 [2018-11-18 09:50:35,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1509 states and 2003 transitions. [2018-11-18 09:50:35,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 09:50:35,845 INFO L705 BuchiCegarLoop]: Abstraction has 1509 states and 2003 transitions. [2018-11-18 09:50:35,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states and 2003 transitions. [2018-11-18 09:50:35,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1508. [2018-11-18 09:50:35,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1508 states. [2018-11-18 09:50:35,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 2001 transitions. [2018-11-18 09:50:35,864 INFO L728 BuchiCegarLoop]: Abstraction has 1508 states and 2001 transitions. [2018-11-18 09:50:35,864 INFO L608 BuchiCegarLoop]: Abstraction has 1508 states and 2001 transitions. [2018-11-18 09:50:35,864 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 09:50:35,864 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1508 states and 2001 transitions. [2018-11-18 09:50:35,869 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-18 09:50:35,870 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:50:35,870 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:50:35,871 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 09:50:35,871 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:50:35,871 INFO L794 eck$LassoCheckResult]: Stem: 6436#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 6307#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 6308#L606-3 [2018-11-18 09:50:35,871 INFO L796 eck$LassoCheckResult]: Loop: 6308#L606-3 assume true; 7372#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7370#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; 7368#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); 7366#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 7364#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); 7362#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 7360#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); 7358#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 7356#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)); 7354#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); 7352#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); 7350#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); 7348#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 7346#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); 7344#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 7342#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 7340#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 7338#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; 6514#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 7747#L606-3 assume true; 7692#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7691#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; 7664#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; 6415#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 7660#L606-3 assume true; 7658#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7656#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; 7654#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); 7652#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 7650#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); 7648#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 7646#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); 7644#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 7642#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)); 7640#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); 7638#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); 7636#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); 7634#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 7632#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); 7630#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 7628#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 7626#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 7624#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); 7622#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); 7620#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 7618#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); 7616#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 7614#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 7612#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); 7610#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 7608#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); 7606#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); 7604#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 7602#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 7600#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 7598#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 7596#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); 7594#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 7592#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 7590#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 7588#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); 7586#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 7584#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 6708#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); 6709#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 7135#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); 7133#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); 7131#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 7129#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); 7127#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 7125#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 7123#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)); 7121#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); 7118#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; 7119#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6308#L606-3 [2018-11-18 09:50:35,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:50:35,872 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-18 09:50:35,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:50:35,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:50:35,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:50:35,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:50:35,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:50:35,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:50:35,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:50:35,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:50:35,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1219893882, now seen corresponding path program 1 times [2018-11-18 09:50:35,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:50:35,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:50:35,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:50:35,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:50:35,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:50:35,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:50:35,901 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 09:50:35,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:50:35,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:50:35,902 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 09:50:35,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:50:35,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:50:35,902 INFO L87 Difference]: Start difference. First operand 1508 states and 2001 transitions. cyclomatic complexity: 495 Second operand 3 states. [2018-11-18 09:50:36,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:50:36,506 INFO L93 Difference]: Finished difference Result 1507 states and 1821 transitions. [2018-11-18 09:50:36,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:50:36,507 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1507 states and 1821 transitions. [2018-11-18 09:50:36,510 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-18 09:50:36,513 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1507 states to 1507 states and 1821 transitions. [2018-11-18 09:50:36,514 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1507 [2018-11-18 09:50:36,515 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1507 [2018-11-18 09:50:36,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1507 states and 1821 transitions. [2018-11-18 09:50:36,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 09:50:36,516 INFO L705 BuchiCegarLoop]: Abstraction has 1507 states and 1821 transitions. [2018-11-18 09:50:36,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states and 1821 transitions. [2018-11-18 09:50:36,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1507. [2018-11-18 09:50:36,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2018-11-18 09:50:36,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1821 transitions. [2018-11-18 09:50:36,528 INFO L728 BuchiCegarLoop]: Abstraction has 1507 states and 1821 transitions. [2018-11-18 09:50:36,529 INFO L608 BuchiCegarLoop]: Abstraction has 1507 states and 1821 transitions. [2018-11-18 09:50:36,529 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 09:50:36,529 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1507 states and 1821 transitions. [2018-11-18 09:50:36,533 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-18 09:50:36,533 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:50:36,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:50:36,534 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 09:50:36,534 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:50:36,534 INFO L794 eck$LassoCheckResult]: Stem: 9451#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 9328#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 9329#L606-3 [2018-11-18 09:50:36,535 INFO L796 eck$LassoCheckResult]: Loop: 9329#L606-3 assume true; 10394#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 10392#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; 10390#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); 10388#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 10386#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); 10384#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 10382#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); 10380#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 10378#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)); 10376#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); 10374#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); 10372#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); 10370#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 10368#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); 10366#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 10364#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 10362#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 10358#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); 10359#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); 10822#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 10820#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); 9401#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 9402#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 9623#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); 10740#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10739#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); 10738#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); 10724#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 9789#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; 9680#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9782#L606-3 assume true; 9780#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 9778#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; 9776#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); 9774#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 9772#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); 9770#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 9768#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); 9766#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 9764#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)); 9762#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); 9760#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); 9758#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); 9756#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 9754#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); 9752#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 9750#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 9748#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 9746#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); 9744#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); 9742#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 9740#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); 9738#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 9736#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 9734#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); 9732#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 9730#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); 9728#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); 9725#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 9723#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 9721#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 9719#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 9717#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); 9715#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 9713#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 9711#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 9709#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); 9707#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 9705#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 9703#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); 9701#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 9699#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); 9697#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); 9695#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 9693#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); 9691#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 9689#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 9687#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)); 9685#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); 9682#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; 9683#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9329#L606-3 [2018-11-18 09:50:36,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:50:36,535 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-18 09:50:36,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:50:36,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:50:36,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:50:36,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:50:36,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:50:36,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:50:36,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:50:36,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:50:36,539 INFO L82 PathProgramCache]: Analyzing trace with hash -606648447, now seen corresponding path program 1 times [2018-11-18 09:50:36,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:50:36,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:50:36,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:50:36,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:50:36,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:50:36,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:50:36,598 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:50:36,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:50:36,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:50:36,599 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 09:50:36,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:50:36,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:50:36,599 INFO L87 Difference]: Start difference. First operand 1507 states and 1821 transitions. cyclomatic complexity: 316 Second operand 3 states. [2018-11-18 09:50:36,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:50:36,788 INFO L93 Difference]: Finished difference Result 1496 states and 1777 transitions. [2018-11-18 09:50:36,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:50:36,789 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1496 states and 1777 transitions. [2018-11-18 09:50:36,792 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-18 09:50:36,796 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1496 states to 1496 states and 1777 transitions. [2018-11-18 09:50:36,796 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1496 [2018-11-18 09:50:36,797 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1496 [2018-11-18 09:50:36,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1496 states and 1777 transitions. [2018-11-18 09:50:36,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 09:50:36,799 INFO L705 BuchiCegarLoop]: Abstraction has 1496 states and 1777 transitions. [2018-11-18 09:50:36,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states and 1777 transitions. [2018-11-18 09:50:36,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1496. [2018-11-18 09:50:36,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2018-11-18 09:50:36,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 1777 transitions. [2018-11-18 09:50:36,812 INFO L728 BuchiCegarLoop]: Abstraction has 1496 states and 1777 transitions. [2018-11-18 09:50:36,812 INFO L608 BuchiCegarLoop]: Abstraction has 1496 states and 1777 transitions. [2018-11-18 09:50:36,812 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 09:50:36,812 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1496 states and 1777 transitions. [2018-11-18 09:50:36,816 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-18 09:50:36,816 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:50:36,816 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:50:36,817 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 09:50:36,817 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:50:36,818 INFO L794 eck$LassoCheckResult]: Stem: 12456#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 12337#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 12338#L606-3 [2018-11-18 09:50:36,819 INFO L796 eck$LassoCheckResult]: Loop: 12338#L606-3 assume true; 13007#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 13005#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; 13003#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); 13001#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 12999#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); 12997#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 12995#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); 12993#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 12991#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)); 12989#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); 12987#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); 12985#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); 12983#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 12981#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); 12979#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 12977#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 12975#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 12973#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); 12971#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); 12969#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 12967#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); 12965#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 12963#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 12961#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); 12959#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12957#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); 12955#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); 12953#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 12849#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 12850#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 13802#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 13800#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); 12409#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 12410#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 12438#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 12369#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); 12370#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 12439#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 12373#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); 12374#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 12424#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); 12393#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); 12394#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 12589#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); 13775#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 12848#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 12425#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)); 12426#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); 12427#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); 12428#L259 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && (((9 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)); 12429#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); 12602#L276 assume !(7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 1 == ~a21~0 && 1 == ~a19~0 && 5 == calculate_output_~input && !(1 == ~a11~0)); 13455#L280 assume !(8 == ~a28~0 && 1 == ~a21~0 && (!(1 == ~a11~0) && (1 == calculate_output_~input && 8 == ~a17~0) && 1 == ~a19~0) && 1 == ~a25~0); 13763#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); 13761#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); 13759#L291 assume !(8 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a11~0) && 1 == ~a25~0 && 8 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a19~0); 13757#L293 assume !((1 == ~a19~0 && 8 == ~a17~0 && ((!(1 == ~a25~0) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a11~0)) && 11 == ~a28~0); 13755#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); 13753#L309 assume !((((((3 == calculate_output_~input && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)) && 11 == ~a28~0) && !(1 == ~a11~0)); 13751#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); 13749#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); 13747#L331 assume !((!(1 == ~a11~0) && (((4 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0) && 11 == ~a28~0) && 1 == ~a19~0); 13745#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)); 13743#L349 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && ((1 == ~a25~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 11 == ~a28~0) && 1 == ~a21~0); 13741#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); 13739#L361 assume !(1 == ~a19~0 && ((1 == ~a21~0 && (!(1 == ~a25~0) && 3 == calculate_output_~input) && 9 == ~a17~0) && 8 == ~a28~0) && 1 == ~a11~0); 13737#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)); 13736#L375 assume !(1 == ~a19~0 && (((8 == ~a17~0 && 5 == calculate_output_~input && !(1 == ~a11~0)) && 1 == ~a21~0) && 1 == ~a25~0) && 8 == ~a28~0); 13734#L378 assume !(((!(1 == ~a11~0) && ((1 == ~a21~0 && 4 == calculate_output_~input) && 10 == ~a28~0) && 8 == ~a17~0) && !(1 == ~a19~0)) && 1 == ~a25~0); 13732#L380 assume !(8 == ~a28~0 && (1 == ~a19~0 && 1 == ~a11~0 && !(1 == ~a25~0) && 9 == ~a17~0 && 6 == calculate_output_~input) && 1 == ~a21~0); 12389#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)); 12390#L394 assume !(((((!(1 == ~a25~0) && 1 == ~a19~0 && 3 == calculate_output_~input) && 9 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 12514#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)); 12515#L402 assume !(((!(1 == ~a11~0) && ((1 == ~a19~0 && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)); 13773#L404 assume !((1 == ~a11~0 && 1 == ~a19~0 && 1 == ~a21~0 && (9 == ~a17~0 && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 8 == ~a28~0); 13772#L407 assume !(!(1 == ~a11~0) && 1 == ~a21~0 && (1 == ~a19~0 && 8 == ~a17~0 && 1 == ~a25~0 && 5 == calculate_output_~input) && 11 == ~a28~0); 12512#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); 12513#L414 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13608#L414-2 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13607#L417-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13606#L420-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13604#L423-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13602#L426-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13601#L429-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13600#L432-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13598#L435-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12355#L438-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13599#L441-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13597#L444-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13596#L447-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13595#L450-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13594#L453-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13127#L456-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13101#L459-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13100#L462-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13098#L465-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13095#L468-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13093#L471-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13091#L474-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13089#L477-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13087#L480-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13085#L483-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13083#L486-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13081#L489-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13079#L492-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13077#L495-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13075#L498-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13073#L501-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13071#L504-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13069#L507-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13067#L510-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13065#L513-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12488#L516-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13062#L519-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13060#L522-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13058#L525-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13056#L528-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13054#L531-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13052#L534-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13050#L537-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13048#L540-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13046#L543-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13044#L546-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13042#L549-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13040#L552-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13038#L555-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13036#L558-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13034#L561-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13032#L564-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13030#L567-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13028#L570-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13026#L573-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13024#L576-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13022#L579-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13020#L582-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13018#L585-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13016#L588-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13014#L591-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13012#L594-1 calculate_output_#res := -2; 13010#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 12338#L606-3 [2018-11-18 09:50:36,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:50:36,819 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-18 09:50:36,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:50:36,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:50:36,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:50:36,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:50:36,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:50:36,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:50:36,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:50:36,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:50:36,824 INFO L82 PathProgramCache]: Analyzing trace with hash 245249823, now seen corresponding path program 1 times [2018-11-18 09:50:36,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:50:36,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:50:36,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:50:36,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:50:36,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:50:36,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:50:36,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:50:36,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:50:36,866 INFO L82 PathProgramCache]: Analyzing trace with hash -2003304803, now seen corresponding path program 1 times [2018-11-18 09:50:36,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:50:36,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:50:36,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:50:36,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:50:36,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:50:36,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:50:37,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:50:37,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:50:37,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 09:50:37,847 WARN L180 SmtUtils]: Spent 629.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2018-11-18 09:50:37,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 09:50:37,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-18 09:50:37,945 INFO L87 Difference]: Start difference. First operand 1496 states and 1777 transitions. cyclomatic complexity: 284 Second operand 10 states. [2018-11-18 09:50:38,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:50:38,715 INFO L93 Difference]: Finished difference Result 1688 states and 1966 transitions. [2018-11-18 09:50:38,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 09:50:38,716 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1688 states and 1966 transitions. [2018-11-18 09:50:38,721 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1632 [2018-11-18 09:50:38,726 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1688 states to 1688 states and 1966 transitions. [2018-11-18 09:50:38,726 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1688 [2018-11-18 09:50:38,728 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1688 [2018-11-18 09:50:38,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1688 states and 1966 transitions. [2018-11-18 09:50:38,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 09:50:38,730 INFO L705 BuchiCegarLoop]: Abstraction has 1688 states and 1966 transitions. [2018-11-18 09:50:38,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states and 1966 transitions. [2018-11-18 09:50:38,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1546. [2018-11-18 09:50:38,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2018-11-18 09:50:38,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 1824 transitions. [2018-11-18 09:50:38,748 INFO L728 BuchiCegarLoop]: Abstraction has 1546 states and 1824 transitions. [2018-11-18 09:50:38,748 INFO L608 BuchiCegarLoop]: Abstraction has 1546 states and 1824 transitions. [2018-11-18 09:50:38,748 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 09:50:38,748 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1546 states and 1824 transitions. [2018-11-18 09:50:38,753 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1490 [2018-11-18 09:50:38,753 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:50:38,753 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:50:38,754 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:50:38,754 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:50:38,754 INFO L794 eck$LassoCheckResult]: Stem: 15664#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; 16354#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16352#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; 16350#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); 16348#L35 assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res := 22; 15805#L597 [2018-11-18 09:50:38,754 INFO L796 eck$LassoCheckResult]: Loop: 15805#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 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; 15805#L597 [2018-11-18 09:50:38,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:50:38,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1805984299, now seen corresponding path program 1 times [2018-11-18 09:50:38,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:50:38,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:50:38,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:50:38,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:50:38,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:50:38,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:50:38,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:50:38,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:50:38,761 INFO L82 PathProgramCache]: Analyzing trace with hash -278812021, now seen corresponding path program 1 times [2018-11-18 09:50:38,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:50:38,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:50:38,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:50:38,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:50:38,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:50:38,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:50:38,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:50:38,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:50:38,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1569761375, now seen corresponding path program 1 times [2018-11-18 09:50:38,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:50:38,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:50:38,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:50:38,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:50:38,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:50:38,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:50:38,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:50:38,969 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:50:38,970 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:50:38,970 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:50:38,970 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:50:38,970 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 09:50:38,970 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:50:38,970 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:50:38,970 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:50:38,970 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label15_true-unreach-call_false-termination.c_Iteration8_Lasso [2018-11-18 09:50:38,970 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:50:38,970 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:50:38,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:50:38,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:50:38,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:50:38,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:50:38,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:50:38,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:50:38,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:50:38,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:50:38,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:50:38,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:50:38,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:50:38,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:50:38,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:50:38,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:50:38,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:50:38,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:50:39,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:50:39,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:50:39,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:50:39,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:50:39,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:50:39,132 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:50:39,132 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d03a45a7-697f-48d5-986c-aacd3e913502/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:50:39,136 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:50:39,136 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:50:39,138 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:50:39,138 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_d03a45a7-697f-48d5-986c-aacd3e913502/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:50:39,154 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:50:39,154 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:50:39,156 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:50:39,156 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~f~0=0} Honda state: {~f~0=6} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d03a45a7-697f-48d5-986c-aacd3e913502/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:50:39,172 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:50:39,172 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:50:39,176 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:50:39,176 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_d03a45a7-697f-48d5-986c-aacd3e913502/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:50:39,193 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:50:39,193 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:50:39,195 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:50:39,195 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_d03a45a7-697f-48d5-986c-aacd3e913502/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:50:39,210 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:50:39,210 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:50:39,212 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:50:39,212 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_d03a45a7-697f-48d5-986c-aacd3e913502/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:50:39,227 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:50:39,227 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:50:39,229 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:50:39,230 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_d03a45a7-697f-48d5-986c-aacd3e913502/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:50:39,246 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:50:39,246 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:50:39,248 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:50:39,248 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_d03a45a7-697f-48d5-986c-aacd3e913502/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:50:39,263 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:50:39,263 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:50:39,265 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:50:39,265 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_d03a45a7-697f-48d5-986c-aacd3e913502/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:50:39,281 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:50:39,281 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:50:39,283 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:50:39,284 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_d03a45a7-697f-48d5-986c-aacd3e913502/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:50:39,300 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:50:39,300 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:50:39,302 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:50:39,302 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_d03a45a7-697f-48d5-986c-aacd3e913502/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:50:39,318 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:50:39,318 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:50:39,320 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:50:39,320 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_d03a45a7-697f-48d5-986c-aacd3e913502/bin-2019/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:50:39,335 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:50:39,335 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:50:39,337 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:50:39,337 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_d03a45a7-697f-48d5-986c-aacd3e913502/bin-2019/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:50:39,354 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:50:39,355 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:50:39,357 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:50:39,357 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_d03a45a7-697f-48d5-986c-aacd3e913502/bin-2019/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:50:39,373 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:50:39,373 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:50:39,375 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:50:39,375 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_d03a45a7-697f-48d5-986c-aacd3e913502/bin-2019/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:50:39,390 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:50:39,390 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:50:39,392 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:50:39,392 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_d03a45a7-697f-48d5-986c-aacd3e913502/bin-2019/uautomizer/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:50:39,408 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:50:39,408 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d03a45a7-697f-48d5-986c-aacd3e913502/bin-2019/uautomizer/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:50:39,427 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 09:50:39,427 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:50:39,586 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:50:39,586 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_d03a45a7-697f-48d5-986c-aacd3e913502/bin-2019/uautomizer/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:50:39,602 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:50:39,602 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:50:39,604 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:50:39,604 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_d03a45a7-697f-48d5-986c-aacd3e913502/bin-2019/uautomizer/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:50:39,633 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:50:39,633 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d03a45a7-697f-48d5-986c-aacd3e913502/bin-2019/uautomizer/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:50:39,650 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 09:50:39,650 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:50:39,785 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:50:39,785 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_d03a45a7-697f-48d5-986c-aacd3e913502/bin-2019/uautomizer/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:50:39,801 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:50:39,801 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:50:39,802 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:50:39,803 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_d03a45a7-697f-48d5-986c-aacd3e913502/bin-2019/uautomizer/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:50:39,818 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:50:39,818 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:50:39,820 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:50:39,820 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_d03a45a7-697f-48d5-986c-aacd3e913502/bin-2019/uautomizer/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:50:39,836 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:50:39,836 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:50:39,839 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:50:39,839 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a28~0=0} Honda state: {~a28~0=10} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2018-11-18 09:50:39,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 09:50:39 BoogieIcfgContainer [2018-11-18 09:50:39,876 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 09:50:39,876 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 09:50:39,877 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 09:50:39,880 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 09:50:39,880 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:50:30" (3/4) ... [2018-11-18 09:50:39,883 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-18 09:50:39,921 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d03a45a7-697f-48d5-986c-aacd3e913502/bin-2019/uautomizer/witness.graphml [2018-11-18 09:50:39,921 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 09:50:39,921 INFO L168 Benchmark]: Toolchain (without parser) took 10991.39 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 483.4 MB). Free memory was 950.1 MB in the beginning and 1.4 GB in the end (delta: -455.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. [2018-11-18 09:50:39,922 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:50:39,922 INFO L168 Benchmark]: CACSL2BoogieTranslator took 388.55 ms. Allocated memory is still 1.0 GB. Free memory was 950.1 MB in the beginning and 920.6 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-11-18 09:50:39,922 INFO L168 Benchmark]: Boogie Procedure Inliner took 111.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 920.6 MB in the beginning and 1.1 GB in the end (delta: -223.4 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2018-11-18 09:50:39,923 INFO L168 Benchmark]: Boogie Preprocessor took 48.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 09:50:39,923 INFO L168 Benchmark]: RCFGBuilder took 1030.16 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: 101.6 MB). Peak memory consumption was 101.6 MB. Max. memory is 11.5 GB. [2018-11-18 09:50:39,923 INFO L168 Benchmark]: BuchiAutomizer took 9365.42 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 332.4 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -368.7 MB). Peak memory consumption was 508.1 MB. Max. memory is 11.5 GB. [2018-11-18 09:50:39,924 INFO L168 Benchmark]: Witness Printer took 44.34 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 302.6 kB). Peak memory consumption was 302.6 kB. Max. memory is 11.5 GB. [2018-11-18 09:50:39,926 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 388.55 ms. Allocated memory is still 1.0 GB. Free memory was 950.1 MB in the beginning and 920.6 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 111.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 920.6 MB in the beginning and 1.1 GB in the end (delta: -223.4 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1030.16 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: 101.6 MB). Peak memory consumption was 101.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9365.42 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 332.4 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -368.7 MB). Peak memory consumption was 508.1 MB. Max. memory is 11.5 GB. * Witness Printer took 44.34 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 302.6 kB). Peak memory consumption was 302.6 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (7 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.7 modules have a trivial ranking function, the largest among these consists of 10 locations. The remainder module has 1546 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.3s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 5.2s. Construction of modules took 2.7s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 147 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 1546 states and ocurred in iteration 7. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1469 SDtfs, 3082 SDslu, 490 SDs, 0 SdLazy, 3702 SolverSat, 849 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time LassoAnalysisResults: nont1 unkn0 SFLI4 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital65 mio100 ax100 hnf103 lsp39 ukn90 mio100 lsp100 div100 bol100 ite100 ukn100 eq209 hnf93 smp100 dnf148 smp89 tf102 neg98 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 57ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 0 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 31 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s - 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@125530fb=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3dee5e43=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@125530fb=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3dee5e43=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@125530fb=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@3dee5e43=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...