./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label45_false-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3d99cc12-a71f-463d-a694-d670d726d023/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3d99cc12-a71f-463d-a694-d670d726d023/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3d99cc12-a71f-463d-a694-d670d726d023/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3d99cc12-a71f-463d-a694-d670d726d023/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label45_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3d99cc12-a71f-463d-a694-d670d726d023/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3d99cc12-a71f-463d-a694-d670d726d023/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 eadb33136c36588f3040fbda14d62db855361eef .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-1dbac8b [2018-11-10 08:08:37,084 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 08:08:37,086 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 08:08:37,092 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 08:08:37,093 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 08:08:37,093 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 08:08:37,094 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 08:08:37,095 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 08:08:37,096 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 08:08:37,097 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 08:08:37,097 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 08:08:37,097 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 08:08:37,098 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 08:08:37,099 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 08:08:37,099 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 08:08:37,100 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 08:08:37,100 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 08:08:37,101 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 08:08:37,102 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 08:08:37,103 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 08:08:37,103 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 08:08:37,104 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 08:08:37,105 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 08:08:37,105 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 08:08:37,105 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 08:08:37,106 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 08:08:37,106 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 08:08:37,107 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 08:08:37,107 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 08:08:37,108 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 08:08:37,108 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 08:08:37,108 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 08:08:37,109 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 08:08:37,109 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 08:08:37,109 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 08:08:37,110 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 08:08:37,110 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3d99cc12-a71f-463d-a694-d670d726d023/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 08:08:37,119 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 08:08:37,119 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 08:08:37,120 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 08:08:37,120 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 08:08:37,120 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 08:08:37,120 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 08:08:37,120 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 08:08:37,120 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 08:08:37,121 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 08:08:37,121 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 08:08:37,121 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 08:08:37,121 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 08:08:37,121 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 08:08:37,121 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 08:08:37,121 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 08:08:37,121 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 08:08:37,122 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 08:08:37,122 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 08:08:37,122 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 08:08:37,122 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 08:08:37,122 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 08:08:37,122 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 08:08:37,122 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 08:08:37,123 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 08:08:37,123 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 08:08:37,123 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 08:08:37,123 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 08:08:37,123 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 08:08:37,123 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 08:08:37,123 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 08:08:37,124 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 08:08:37,124 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_3d99cc12-a71f-463d-a694-d670d726d023/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 -> eadb33136c36588f3040fbda14d62db855361eef [2018-11-10 08:08:37,148 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 08:08:37,156 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 08:08:37,159 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 08:08:37,160 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 08:08:37,160 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 08:08:37,161 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3d99cc12-a71f-463d-a694-d670d726d023/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label45_false-unreach-call_false-termination.c [2018-11-10 08:08:37,200 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3d99cc12-a71f-463d-a694-d670d726d023/bin-2019/uautomizer/data/3e78f7e51/02535b46484e4e36b49387eaa4a1c73a/FLAG3bad5b1a6 [2018-11-10 08:08:37,553 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 08:08:37,554 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3d99cc12-a71f-463d-a694-d670d726d023/sv-benchmarks/c/eca-rers2012/Problem02_label45_false-unreach-call_false-termination.c [2018-11-10 08:08:37,563 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3d99cc12-a71f-463d-a694-d670d726d023/bin-2019/uautomizer/data/3e78f7e51/02535b46484e4e36b49387eaa4a1c73a/FLAG3bad5b1a6 [2018-11-10 08:08:37,573 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3d99cc12-a71f-463d-a694-d670d726d023/bin-2019/uautomizer/data/3e78f7e51/02535b46484e4e36b49387eaa4a1c73a [2018-11-10 08:08:37,575 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 08:08:37,576 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 08:08:37,577 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 08:08:37,577 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 08:08:37,580 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 08:08:37,581 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:08:37" (1/1) ... [2018-11-10 08:08:37,582 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18da3d15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:08:37, skipping insertion in model container [2018-11-10 08:08:37,583 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:08:37" (1/1) ... [2018-11-10 08:08:37,588 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 08:08:37,621 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 08:08:37,850 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 08:08:37,853 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 08:08:37,918 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 08:08:37,929 INFO L193 MainTranslator]: Completed translation [2018-11-10 08:08:37,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:08:37 WrapperNode [2018-11-10 08:08:37,930 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 08:08:37,930 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 08:08:37,930 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 08:08:37,930 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 08:08:37,935 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:08:37" (1/1) ... [2018-11-10 08:08:37,946 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:08:37" (1/1) ... [2018-11-10 08:08:38,020 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 08:08:38,020 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 08:08:38,021 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 08:08:38,021 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 08:08:38,026 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:08:37" (1/1) ... [2018-11-10 08:08:38,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:08:37" (1/1) ... [2018-11-10 08:08:38,030 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:08:37" (1/1) ... [2018-11-10 08:08:38,030 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:08:37" (1/1) ... [2018-11-10 08:08:38,042 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:08:37" (1/1) ... [2018-11-10 08:08:38,050 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:08:37" (1/1) ... [2018-11-10 08:08:38,054 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:08:37" (1/1) ... [2018-11-10 08:08:38,059 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 08:08:38,060 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 08:08:38,060 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 08:08:38,060 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 08:08:38,061 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:08:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d99cc12-a71f-463d-a694-d670d726d023/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-10 08:08:38,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 08:08:38,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 08:08:38,982 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 08:08:38,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:08:38 BoogieIcfgContainer [2018-11-10 08:08:38,983 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 08:08:38,983 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 08:08:38,984 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 08:08:38,986 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 08:08:38,987 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 08:08:38,987 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 08:08:37" (1/3) ... [2018-11-10 08:08:38,988 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e6c8dea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 08:08:38, skipping insertion in model container [2018-11-10 08:08:38,988 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 08:08:38,988 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:08:37" (2/3) ... [2018-11-10 08:08:38,988 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e6c8dea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 08:08:38, skipping insertion in model container [2018-11-10 08:08:38,988 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 08:08:38,988 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:08:38" (3/3) ... [2018-11-10 08:08:38,990 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label45_false-unreach-call_false-termination.c [2018-11-10 08:08:39,021 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 08:08:39,022 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 08:08:39,022 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 08:08:39,022 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 08:08:39,022 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 08:08:39,022 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 08:08:39,023 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 08:08:39,023 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 08:08:39,023 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 08:08:39,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-10 08:08:39,058 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-10 08:08:39,058 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:08:39,058 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:08:39,064 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 08:08:39,064 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 08:08:39,064 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 08:08:39,065 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-10 08:08:39,070 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-10 08:08:39,070 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:08:39,070 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:08:39,071 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 08:08:39,071 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 08:08:39,076 INFO L793 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-10 08:08:39,076 INFO L795 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 !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);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 ((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8;~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-10 08:08:39,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:39,080 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 08:08:39,082 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:39,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:39,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:39,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:08:39,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:39,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:08:39,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:08:39,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:39,148 INFO L82 PathProgramCache]: Analyzing trace with hash 34545679, now seen corresponding path program 1 times [2018-11-10 08:08:39,148 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:39,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:39,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:39,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:08:39,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:39,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:08:39,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:08:39,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:39,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1805985165, now seen corresponding path program 1 times [2018-11-10 08:08:39,170 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:39,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:39,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:39,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:08:39,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:08:39,237 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-10 08:08:39,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:08:39,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 08:08:39,403 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2018-11-10 08:08:39,438 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:08:39,439 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:08:39,439 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:08:39,440 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:08:39,440 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 08:08:39,440 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:39,440 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:08:39,440 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:08:39,440 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label45_false-unreach-call_false-termination.c_Iteration1_Loop [2018-11-10 08:08:39,440 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:08:39,441 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:08:39,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:39,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:39,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:39,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:39,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-10 08:08:39,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:39,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:39,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:39,788 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:08:39,789 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d99cc12-a71f-463d-a694-d670d726d023/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-10 08:08:39,799 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:39,799 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:39,821 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:39,821 INFO L446 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_3d99cc12-a71f-463d-a694-d670d726d023/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) [2018-11-10 08:08:39,838 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:39,839 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:39,854 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:39,854 INFO L446 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_3d99cc12-a71f-463d-a694-d670d726d023/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) [2018-11-10 08:08:39,885 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:39,885 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:39,926 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:39,926 INFO L446 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_3d99cc12-a71f-463d-a694-d670d726d023/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-10 08:08:39,935 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:39,935 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:39,942 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:39,942 INFO L446 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_3d99cc12-a71f-463d-a694-d670d726d023/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:39,974 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:39,974 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:39,995 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:39,995 INFO L446 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_3d99cc12-a71f-463d-a694-d670d726d023/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-10 08:08:40,003 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:40,003 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:40,005 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:40,005 INFO L446 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_3d99cc12-a71f-463d-a694-d670d726d023/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-10 08:08:40,032 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:40,032 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:40,038 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:40,038 INFO L446 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_3d99cc12-a71f-463d-a694-d670d726d023/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-10 08:08:40,059 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:40,059 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d99cc12-a71f-463d-a694-d670d726d023/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-10 08:08:40,089 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 08:08:40,090 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:40,122 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 08:08:40,123 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:08:40,123 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:08:40,124 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:08:40,124 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:08:40,124 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 08:08:40,124 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:40,124 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:08:40,124 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:08:40,125 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label45_false-unreach-call_false-termination.c_Iteration1_Loop [2018-11-10 08:08:40,125 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:08:40,125 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:08:40,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:40,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:40,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:40,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:40,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:40,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:40,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:40,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:40,388 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:08:40,392 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 08:08:40,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:40,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:08:40,398 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:08:40,399 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,408 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:40,408 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:08:40,409 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:08:40,409 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,411 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,411 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:40,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,412 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 08:08:40,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:08:40,413 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:08:40,413 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,430 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,430 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:40,431 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:08:40,432 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:08:40,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,437 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,438 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:40,438 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,439 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:08:40,439 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:08:40,439 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,443 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,443 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:40,443 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,444 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:08:40,444 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:08:40,444 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,446 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,446 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:40,447 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,447 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:08:40,447 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:08:40,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,448 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,448 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:40,449 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,449 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 08:08:40,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:08:40,451 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 08:08:40,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,455 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,456 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 08:08:40,456 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:40,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,457 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 08:08:40,458 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 08:08:40,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,464 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,465 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:40,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,466 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 08:08:40,466 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 08:08:40,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,468 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:40,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,470 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 08:08:40,470 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 08:08:40,472 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 08:08:40,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,490 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:40,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,491 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 08:08:40,492 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 08:08:40,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,497 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,498 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:40,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,498 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 08:08:40,499 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 08:08:40,499 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,501 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,501 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:40,504 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,505 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 08:08:40,505 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 08:08:40,505 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,507 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,508 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:40,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,509 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 08:08:40,509 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 08:08:40,509 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,510 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:40,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,511 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 08:08:40,511 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 08:08:40,512 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:08:40,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,520 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,520 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 08:08:40,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:40,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,523 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 08:08:40,524 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 08:08:40,524 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,530 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:40,531 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,532 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 08:08:40,532 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 08:08:40,532 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,536 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,536 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:40,537 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,537 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 08:08:40,537 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 08:08:40,539 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 08:08:40,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,552 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:40,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,554 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 08:08:40,554 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 08:08:40,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,557 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,558 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:40,558 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,559 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 08:08:40,559 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 08:08:40,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,561 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:40,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,562 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 08:08:40,562 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 08:08:40,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,564 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,565 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:40,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,565 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 08:08:40,566 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 08:08:40,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,567 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:40,567 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,568 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 08:08:40,568 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 08:08:40,568 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 08:08:40,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,572 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,572 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 08:08:40,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:40,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,574 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 08:08:40,574 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 08:08:40,575 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,580 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:40,581 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,581 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 08:08:40,582 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 08:08:40,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,584 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,584 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:40,584 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,585 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 08:08:40,585 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 08:08:40,586 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-10 08:08:40,586 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,598 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:40,599 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,600 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 08:08:40,600 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 08:08:40,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,603 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,604 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:40,604 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,605 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 08:08:40,605 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 08:08:40,605 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,607 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,607 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:40,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,608 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 08:08:40,609 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 08:08:40,609 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,610 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,611 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:40,611 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,615 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 08:08:40,616 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 08:08:40,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,617 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:40,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,618 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 08:08:40,618 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 08:08:40,618 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 08:08:40,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,622 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,622 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 08:08:40,623 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,623 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:40,623 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 08:08:40,623 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,624 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 08:08:40,625 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 08:08:40,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,636 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,636 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:40,637 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 08:08:40,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,637 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 08:08:40,638 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 08:08:40,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,640 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,641 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:40,641 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 08:08:40,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,641 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 08:08:40,641 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 08:08:40,643 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 08:08:40,643 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,668 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,669 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,671 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:40,671 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 08:08:40,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,671 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 08:08:40,672 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 08:08:40,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,675 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,676 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:40,676 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 08:08:40,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,677 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 08:08:40,677 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 08:08:40,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,679 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,680 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:40,680 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 08:08:40,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,680 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 08:08:40,681 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 08:08:40,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,683 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,683 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:40,683 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 08:08:40,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,684 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 08:08:40,684 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 08:08:40,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,685 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,687 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:40,687 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 08:08:40,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,687 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 08:08:40,687 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 08:08:40,688 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:08:40,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,694 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,694 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 08:08:40,695 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,695 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:40,695 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 08:08:40,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,696 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 08:08:40,697 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 08:08:40,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,709 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,709 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,710 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:40,710 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 08:08:40,710 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,710 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 08:08:40,711 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 08:08:40,711 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,714 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,715 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:40,715 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 08:08:40,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,716 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 08:08:40,716 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 08:08:40,719 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 08:08:40,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,747 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,748 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:40,748 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 08:08:40,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,749 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 08:08:40,753 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 08:08:40,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,757 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,758 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:40,758 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 08:08:40,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,759 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 08:08:40,759 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 08:08:40,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,762 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,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-10 08:08:40,763 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:40,763 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 08:08:40,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,763 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 08:08:40,764 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 08:08:40,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,767 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,768 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:40,768 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 08:08:40,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,768 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 08:08:40,769 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 08:08:40,769 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,770 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,771 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:40,771 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 08:08:40,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,771 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 08:08:40,771 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 08:08:40,772 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 08:08:40,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,779 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,780 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 08:08:40,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,780 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:40,781 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 08:08:40,781 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,781 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 08:08:40,783 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 08:08:40,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,795 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,795 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:40,796 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 08:08:40,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,796 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 08:08:40,797 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 08:08:40,797 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,801 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,802 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:40,802 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 08:08:40,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,803 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 08:08:40,803 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 08:08:40,807 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-10 08:08:40,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,841 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,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-10 08:08:40,842 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:40,842 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 08:08:40,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,842 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 08:08:40,844 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 08:08:40,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,849 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,850 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:40,850 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 08:08:40,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,851 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 08:08:40,852 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 08:08:40,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,856 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,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-10 08:08:40,856 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:40,857 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 08:08:40,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,857 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 08:08:40,858 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 08:08:40,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,861 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,862 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:40,862 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 08:08:40,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,863 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 08:08:40,863 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 08:08:40,864 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,864 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,865 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:40,865 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 08:08:40,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,865 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 08:08:40,865 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 08:08:40,867 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 08:08:40,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,877 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,877 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 08:08:40,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-10 08:08:40,878 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:40,878 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 08:08:40,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,878 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 08:08:40,879 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 08:08:40,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,887 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,888 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:40,888 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 08:08:40,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,889 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 08:08:40,889 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 08:08:40,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,891 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,891 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:40,891 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 08:08:40,892 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,892 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 08:08:40,892 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 08:08:40,893 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 08:08:40,893 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,908 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,909 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,909 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:40,909 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 08:08:40,909 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,909 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 08:08:40,910 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 08:08:40,910 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,914 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,915 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:40,915 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 08:08:40,915 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,915 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 08:08:40,915 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 08:08:40,915 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,917 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,917 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,918 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:40,918 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 08:08:40,918 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,918 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 08:08:40,918 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 08:08:40,918 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,920 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,920 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:40,921 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 08:08:40,921 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,921 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 08:08:40,921 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 08:08:40,921 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,922 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,923 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,923 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:40,923 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 08:08:40,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,923 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 08:08:40,924 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 08:08:40,924 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 08:08:40,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,929 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,929 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 08:08:40,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,930 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:40,930 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 08:08:40,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,930 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 08:08:40,932 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:08:40,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,957 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,957 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,958 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:40,958 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 08:08:40,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,958 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 08:08:40,959 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:08:40,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,961 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,961 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,962 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:40,962 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 08:08:40,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,962 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 08:08:40,962 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 08:08:40,965 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-10 08:08:40,965 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:41,031 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:41,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:41,032 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:41,032 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 08:08:41,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:41,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:41,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:41,033 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 08:08:41,034 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:08:41,034 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:41,042 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:41,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:41,042 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:41,042 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 08:08:41,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:41,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:41,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:41,043 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 08:08:41,043 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:08:41,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:41,047 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:41,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-10 08:08:41,047 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:41,048 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 08:08:41,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:41,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:41,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:41,048 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 08:08:41,049 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:08:41,049 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:41,051 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:41,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:41,052 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:41,052 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 08:08:41,053 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:41,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:41,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:41,053 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 08:08:41,054 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:08:41,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:41,056 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:41,056 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:41,057 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:41,057 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 08:08:41,057 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:41,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:41,057 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 08:08:41,057 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 08:08:41,059 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 08:08:41,059 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:41,067 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:41,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:08:41,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:08:41,082 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 3 states. [2018-11-10 08:08:41,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:08:41,672 INFO L93 Difference]: Finished difference Result 381 states and 548 transitions. [2018-11-10 08:08:41,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:08:41,674 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 381 states and 548 transitions. [2018-11-10 08:08:41,676 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 372 [2018-11-10 08:08:41,680 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 381 states to 374 states and 541 transitions. [2018-11-10 08:08:41,681 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 374 [2018-11-10 08:08:41,683 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 374 [2018-11-10 08:08:41,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 374 states and 541 transitions. [2018-11-10 08:08:41,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 08:08:41,685 INFO L705 BuchiCegarLoop]: Abstraction has 374 states and 541 transitions. [2018-11-10 08:08:41,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states and 541 transitions. [2018-11-10 08:08:41,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2018-11-10 08:08:41,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-11-10 08:08:41,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 539 transitions. [2018-11-10 08:08:41,715 INFO L728 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-10 08:08:41,715 INFO L608 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-10 08:08:41,715 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 08:08:41,715 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 373 states and 539 transitions. [2018-11-10 08:08:41,721 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 371 [2018-11-10 08:08:41,721 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:08:41,721 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:08:41,721 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 08:08:41,721 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:08:41,721 INFO L793 eck$LassoCheckResult]: Stem: 751#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 632#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 633#L606-3 [2018-11-10 08:08:41,722 INFO L795 eck$LassoCheckResult]: Loop: 633#L606-3 assume true; 850#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 733#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);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; 734#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 875#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 760#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 695#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 696#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 844#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 634#L54 assume (((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1);~a28~0 := 7;~a11~0 := 1;~a25~0 := 0;calculate_output_#res := -1; 635#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 633#L606-3 [2018-11-10 08:08:41,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:41,722 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-10 08:08:41,722 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:41,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:41,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:41,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:08:41,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:41,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:08:41,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:08:41,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:41,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1956321088, now seen corresponding path program 1 times [2018-11-10 08:08:41,726 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:41,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:41,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:41,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:08:41,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:41,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:08:41,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:08:41,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:41,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1962170302, now seen corresponding path program 1 times [2018-11-10 08:08:41,739 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:41,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:41,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:41,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:08:41,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:41,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:08:41,766 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-10 08:08:41,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:08:41,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 08:08:41,853 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:08:41,853 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:08:41,853 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:08:41,853 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:08:41,853 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 08:08:41,853 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:41,853 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:08:41,853 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:08:41,853 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label45_false-unreach-call_false-termination.c_Iteration2_Loop [2018-11-10 08:08:41,853 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:08:41,853 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:08:41,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:41,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:41,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:41,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:41,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:41,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:41,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:41,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:41,967 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:08:41,967 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d99cc12-a71f-463d-a694-d670d726d023/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-10 08:08:41,974 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:41,974 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:41,991 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:41,991 INFO L446 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_3d99cc12-a71f-463d-a694-d670d726d023/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-10 08:08:41,996 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:41,996 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:41,999 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:42,000 INFO L446 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_3d99cc12-a71f-463d-a694-d670d726d023/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-10 08:08:42,026 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:42,026 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:42,028 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:42,028 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=-2} Honda state: {~a19~0=-2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d99cc12-a71f-463d-a694-d670d726d023/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-10 08:08:42,055 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:42,055 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:42,061 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:42,061 INFO L446 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_3d99cc12-a71f-463d-a694-d670d726d023/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-10 08:08:42,078 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:42,078 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:42,096 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:42,097 INFO L446 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_3d99cc12-a71f-463d-a694-d670d726d023/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-10 08:08:42,102 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:42,102 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d99cc12-a71f-463d-a694-d670d726d023/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-10 08:08:42,126 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 08:08:42,126 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:42,156 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 08:08:42,157 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:08:42,157 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:08:42,157 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:08:42,157 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:08:42,157 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 08:08:42,157 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:42,158 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:08:42,158 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:08:42,158 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label45_false-unreach-call_false-termination.c_Iteration2_Loop [2018-11-10 08:08:42,158 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:08:42,158 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:08:42,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:42,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:42,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:42,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:42,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:42,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:42,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:42,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:42,271 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:08:42,271 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 08:08:42,271 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:42,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:42,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:08:42,272 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:08:42,273 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,274 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,274 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:42,274 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:42,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:08:42,275 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:08:42,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,276 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:42,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,276 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 08:08:42,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:08:42,277 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 08:08:42,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,277 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,277 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:42,278 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:42,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:08:42,278 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:08:42,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,279 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,279 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:42,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:42,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:08:42,280 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:08:42,280 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,280 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,281 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:42,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,281 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 08:08:42,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:08:42,282 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 08:08:42,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,283 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,283 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:42,283 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,284 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 08:08:42,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:08:42,284 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 08:08:42,284 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,286 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,286 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:42,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:42,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:08:42,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:08:42,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,289 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,289 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 08:08:42,289 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:42,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:42,290 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 08:08:42,290 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 08:08:42,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,291 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,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-10 08:08:42,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:42,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:42,292 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 08:08:42,292 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 08:08:42,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,293 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,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-10 08:08:42,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:42,294 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,294 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 08:08:42,294 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 08:08:42,295 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:08:42,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,295 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:42,296 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:42,296 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 08:08:42,296 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 08:08:42,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,297 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:42,297 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:42,297 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 08:08:42,298 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 08:08:42,298 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,299 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,299 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:42,299 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,299 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 08:08:42,300 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 08:08:42,300 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:08:42,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,302 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,302 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:42,302 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,302 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 08:08:42,303 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 08:08:42,303 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:08:42,303 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,306 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,306 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:42,307 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:42,307 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 08:08:42,307 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 08:08:42,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,309 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,309 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 08:08:42,310 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:42,310 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:42,310 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 08:08:42,311 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 08:08:42,311 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,312 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,312 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:42,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:42,313 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 08:08:42,313 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 08:08:42,313 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,315 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,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-10 08:08:42,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:42,315 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,316 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 08:08:42,316 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 08:08:42,316 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 08:08:42,316 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,316 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:42,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:42,317 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 08:08:42,318 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 08:08:42,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,318 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,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-10 08:08:42,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:42,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:42,319 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 08:08:42,319 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 08:08:42,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,320 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,321 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:42,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,321 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 08:08:42,321 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 08:08:42,322 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 08:08:42,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,324 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,324 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:42,325 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,325 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 08:08:42,325 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 08:08:42,325 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 08:08:42,326 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,329 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:42,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:42,330 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 08:08:42,331 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 08:08:42,331 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,333 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,333 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 08:08:42,334 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:42,334 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:42,334 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 08:08:42,335 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 08:08:42,335 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,336 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:42,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:42,337 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 08:08:42,337 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 08:08:42,337 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,339 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:42,340 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,340 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 08:08:42,340 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 08:08:42,341 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 08:08:42,341 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,341 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:42,342 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:42,342 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 08:08:42,342 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 08:08:42,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,343 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:42,343 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:42,344 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 08:08:42,344 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 08:08:42,344 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,345 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:42,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,346 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 08:08:42,346 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 08:08:42,347 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 08:08:42,347 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,349 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,349 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:42,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,350 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 08:08:42,350 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 08:08:42,351 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 08:08:42,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,355 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,355 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:42,356 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:42,356 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 08:08:42,356 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 08:08:42,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,359 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,360 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 08:08:42,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-10 08:08:42,360 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:42,360 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 08:08:42,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:42,361 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 08:08:42,361 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 08:08:42,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,363 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,363 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:42,363 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 08:08:42,363 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:42,364 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 08:08:42,364 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 08:08:42,364 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,367 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,367 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:42,367 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 08:08:42,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,368 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 08:08:42,368 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 08:08:42,368 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:08:42,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,369 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,369 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,369 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:42,370 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 08:08:42,370 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:42,370 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 08:08:42,370 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 08:08:42,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,371 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,371 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:42,371 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 08:08:42,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:42,372 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 08:08:42,372 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 08:08:42,372 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,373 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,374 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:42,374 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 08:08:42,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,374 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 08:08:42,375 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 08:08:42,375 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:08:42,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,378 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,379 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:42,379 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 08:08:42,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,379 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 08:08:42,379 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 08:08:42,380 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:08:42,380 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,386 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,387 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:42,387 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 08:08:42,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:42,387 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 08:08:42,388 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 08:08:42,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,391 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,391 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 08:08:42,392 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,392 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:42,392 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 08:08:42,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:42,393 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 08:08:42,393 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 08:08:42,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,395 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,396 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,396 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:42,396 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 08:08:42,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:42,397 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 08:08:42,397 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 08:08:42,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,400 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,401 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:42,401 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 08:08:42,401 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,402 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 08:08:42,402 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 08:08:42,402 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 08:08:42,402 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,403 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,403 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,404 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:42,404 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 08:08:42,404 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:42,404 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 08:08:42,405 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 08:08:42,405 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,406 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,406 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,406 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:42,406 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 08:08:42,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:42,407 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 08:08:42,407 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 08:08:42,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,409 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,410 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:42,410 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 08:08:42,410 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,410 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 08:08:42,410 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 08:08:42,411 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 08:08:42,411 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,416 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,417 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:42,417 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 08:08:42,417 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,418 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 08:08:42,418 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 08:08:42,419 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 08:08:42,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,431 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,431 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,432 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:42,432 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 08:08:42,432 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:42,432 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 08:08:42,433 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 08:08:42,433 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,439 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,439 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 08:08:42,440 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,440 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:42,440 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 08:08:42,440 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:42,441 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 08:08:42,441 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 08:08:42,442 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,445 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,446 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,446 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:42,446 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 08:08:42,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:42,447 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 08:08:42,448 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 08:08:42,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,454 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,454 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,454 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:42,455 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 08:08:42,455 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,455 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 08:08:42,455 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 08:08:42,456 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 08:08:42,457 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,457 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,458 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,458 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:42,458 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 08:08:42,458 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:42,459 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 08:08:42,460 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 08:08:42,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,461 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,461 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:42,461 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 08:08:42,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:42,462 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 08:08:42,463 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 08:08:42,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,466 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,467 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:42,467 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 08:08:42,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,468 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 08:08:42,468 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 08:08:42,471 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 08:08:42,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,480 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,481 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:42,481 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 08:08:42,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,481 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 08:08:42,481 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 08:08:42,484 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 08:08:42,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,508 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,508 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,509 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:42,509 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 08:08:42,509 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:42,510 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 08:08:42,512 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 08:08:42,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,520 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,521 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 08:08:42,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,521 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:42,521 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 08:08:42,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:42,522 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 08:08:42,522 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 08:08:42,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,523 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,524 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:42,524 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 08:08:42,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:42,524 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 08:08:42,525 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 08:08:42,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,528 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,528 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,529 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:42,529 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 08:08:42,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,529 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 08:08:42,529 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 08:08:42,529 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 08:08:42,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,585 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,586 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:42,586 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 08:08:42,586 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:42,587 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 08:08:42,587 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 08:08:42,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,588 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,588 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,589 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:42,589 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 08:08:42,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:42,589 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 08:08:42,591 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 08:08:42,591 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,593 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,594 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:42,594 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 08:08:42,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,594 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 08:08:42,594 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 08:08:42,595 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 08:08:42,595 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,604 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,605 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:42,605 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 08:08:42,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,606 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 08:08:42,606 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 08:08:42,606 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 08:08:42,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,618 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,618 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,619 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:42,619 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 08:08:42,619 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:42,619 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 08:08:42,620 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 08:08:42,620 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,625 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,625 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 08:08:42,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,626 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:42,626 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 08:08:42,626 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:42,626 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 08:08:42,627 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:08:42,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,629 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,630 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:42,630 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 08:08:42,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:42,630 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 08:08:42,631 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:08:42,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,637 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,637 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:42,638 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 08:08:42,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,638 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 08:08:42,638 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 08:08:42,639 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 08:08:42,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,640 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,641 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:42,641 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 08:08:42,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:42,641 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 08:08:42,642 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:08:42,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,644 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,644 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:42,644 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 08:08:42,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:42,645 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 08:08:42,645 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:08:42,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,647 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,648 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:42,648 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 08:08:42,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,648 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 08:08:42,648 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 08:08:42,649 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 08:08:42,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,656 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,657 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:42,657 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 08:08:42,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,657 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 08:08:42,657 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 08:08:42,659 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 08:08:42,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,677 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,677 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:42,678 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 08:08:42,678 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 08:08:42,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:42,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:42,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:42,678 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 08:08:42,679 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:08:42,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:42,698 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:42,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:08:42,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:08:42,698 INFO L87 Difference]: Start difference. First operand 373 states and 539 transitions. cyclomatic complexity: 167 Second operand 3 states. [2018-11-10 08:08:43,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:08:43,129 INFO L93 Difference]: Finished difference Result 660 states and 918 transitions. [2018-11-10 08:08:43,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:08:43,130 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 660 states and 918 transitions. [2018-11-10 08:08:43,133 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-10 08:08:43,137 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 660 states to 660 states and 918 transitions. [2018-11-10 08:08:43,137 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 660 [2018-11-10 08:08:43,138 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 660 [2018-11-10 08:08:43,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 660 states and 918 transitions. [2018-11-10 08:08:43,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 08:08:43,141 INFO L705 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-11-10 08:08:43,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states and 918 transitions. [2018-11-10 08:08:43,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2018-11-10 08:08:43,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2018-11-10 08:08:43,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 918 transitions. [2018-11-10 08:08:43,158 INFO L728 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-11-10 08:08:43,158 INFO L608 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-11-10 08:08:43,158 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 08:08:43,158 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 660 states and 918 transitions. [2018-11-10 08:08:43,161 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-10 08:08:43,161 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:08:43,161 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:08:43,163 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 08:08:43,163 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-10 08:08:43,163 INFO L793 eck$LassoCheckResult]: Stem: 1797#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; 1673#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; 1674#L606-3 [2018-11-10 08:08:43,163 INFO L795 eck$LassoCheckResult]: Loop: 1674#L606-3 assume true; 1904#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1775#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);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; 1776#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 1921#L35 assume ~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1);~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; 2186#L606-3 assume true; 2184#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 2182#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);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; 2180#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 2178#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 2176#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 2174#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 2172#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 2170#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 2168#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 2166#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 2164#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 2162#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 2160#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 2158#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 2156#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 2154#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 2152#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 2149#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 2147#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 2145#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 2143#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 2141#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 2139#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 2137#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 2135#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 2133#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 2131#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 2129#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 2127#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 2125#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 2123#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 2121#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 2119#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 2117#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 2115#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 2113#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 2111#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 2109#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 2107#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 2105#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 2103#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 2101#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 2099#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 2097#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 2095#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 2093#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 2091#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 2090#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 2088#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 1783#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1674#L606-3 [2018-11-10 08:08:43,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:43,164 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-10 08:08:43,164 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:43,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:43,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:43,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:08:43,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:08:43,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:08:43,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:43,168 INFO L82 PathProgramCache]: Analyzing trace with hash 692590236, now seen corresponding path program 1 times [2018-11-10 08:08:43,169 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:43,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:43,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:43,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:08:43,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:43,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:08:43,229 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-10 08:08:43,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:08:43,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 08:08:43,230 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 08:08:43,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 08:08:43,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 08:08:43,230 INFO L87 Difference]: Start difference. First operand 660 states and 918 transitions. cyclomatic complexity: 259 Second operand 4 states. [2018-11-10 08:08:43,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:08:43,990 INFO L93 Difference]: Finished difference Result 1228 states and 1697 transitions. [2018-11-10 08:08:43,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 08:08:43,991 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1228 states and 1697 transitions. [2018-11-10 08:08:43,995 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1224 [2018-11-10 08:08:43,998 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1228 states to 1228 states and 1697 transitions. [2018-11-10 08:08:43,998 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1228 [2018-11-10 08:08:43,999 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1228 [2018-11-10 08:08:44,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1228 states and 1697 transitions. [2018-11-10 08:08:44,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 08:08:44,001 INFO L705 BuchiCegarLoop]: Abstraction has 1228 states and 1697 transitions. [2018-11-10 08:08:44,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states and 1697 transitions. [2018-11-10 08:08:44,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1225. [2018-11-10 08:08:44,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2018-11-10 08:08:44,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1691 transitions. [2018-11-10 08:08:44,015 INFO L728 BuchiCegarLoop]: Abstraction has 1225 states and 1691 transitions. [2018-11-10 08:08:44,015 INFO L608 BuchiCegarLoop]: Abstraction has 1225 states and 1691 transitions. [2018-11-10 08:08:44,015 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 08:08:44,016 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1225 states and 1691 transitions. [2018-11-10 08:08:44,019 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1221 [2018-11-10 08:08:44,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:08:44,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:08:44,021 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 08:08:44,021 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-10 08:08:44,021 INFO L793 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-10 08:08:44,021 INFO L795 eck$LassoCheckResult]: Loop: 3568#L606-3 assume true; 4383#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4381#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);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; 4379#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 4377#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 4375#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 4373#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 4371#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 4338#L50 assume ~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7;~a28~0 := 11;~a25~0 := 1;calculate_output_#res := 26; 3748#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4323#L606-3 assume true; 4321#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4319#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);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; 4317#L30 assume ((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8;~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; 4737#L606-3 assume true; 4596#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4187#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);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; 4177#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 4176#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 4174#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 4172#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 4170#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 4168#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 4166#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 4164#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 4162#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 4160#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 4158#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 4156#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 4154#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 4152#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 4150#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 4148#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 4146#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 4144#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 4142#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 4140#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 4138#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 4136#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 4134#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 4132#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 4130#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 4128#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 4126#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 4124#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 4122#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 4120#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 4118#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 4116#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 4114#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 4112#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 4110#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 4108#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 4106#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 4104#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 4102#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 4100#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 4098#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 4096#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 4094#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 4092#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 4090#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 4088#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 4085#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 4086#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-10 08:08:44,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:44,022 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-10 08:08:44,022 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:44,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:44,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:44,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:08:44,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:44,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:08:44,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:08:44,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:44,026 INFO L82 PathProgramCache]: Analyzing trace with hash 676565178, now seen corresponding path program 1 times [2018-11-10 08:08:44,026 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:44,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:44,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:44,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:08:44,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:44,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:08:44,056 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-10 08:08:44,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:08:44,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:08:44,057 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 08:08:44,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:08:44,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:08:44,057 INFO L87 Difference]: Start difference. First operand 1225 states and 1691 transitions. cyclomatic complexity: 468 Second operand 3 states. [2018-11-10 08:08:44,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:08:44,430 INFO L93 Difference]: Finished difference Result 1509 states and 2000 transitions. [2018-11-10 08:08:44,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:08:44,431 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1509 states and 2000 transitions. [2018-11-10 08:08:44,436 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1505 [2018-11-10 08:08:44,440 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1509 states to 1509 states and 2000 transitions. [2018-11-10 08:08:44,440 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1509 [2018-11-10 08:08:44,441 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1509 [2018-11-10 08:08:44,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1509 states and 2000 transitions. [2018-11-10 08:08:44,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 08:08:44,443 INFO L705 BuchiCegarLoop]: Abstraction has 1509 states and 2000 transitions. [2018-11-10 08:08:44,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states and 2000 transitions. [2018-11-10 08:08:44,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1508. [2018-11-10 08:08:44,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1508 states. [2018-11-10 08:08:44,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 1998 transitions. [2018-11-10 08:08:44,456 INFO L728 BuchiCegarLoop]: Abstraction has 1508 states and 1998 transitions. [2018-11-10 08:08:44,456 INFO L608 BuchiCegarLoop]: Abstraction has 1508 states and 1998 transitions. [2018-11-10 08:08:44,456 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 08:08:44,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1508 states and 1998 transitions. [2018-11-10 08:08:44,461 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-10 08:08:44,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:08:44,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:08:44,462 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 08:08:44,462 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-10 08:08:44,462 INFO L793 eck$LassoCheckResult]: Stem: 6430#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-10 08:08:44,463 INFO L795 eck$LassoCheckResult]: Loop: 6308#L606-3 assume true; 7623#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7621#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);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; 7619#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 7617#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 7615#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 7613#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 7609#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 7601#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 7602#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 7598#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 7599#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 7717#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 7716#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 7714#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 7712#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 7710#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 7708#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 7706#L106 assume (~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1;~a17~0 := 8;~a25~0 := 0;~a19~0 := 0;~a28~0 := 11;~a11~0 := 0;calculate_output_#res := 23; 6544#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6929#L606-3 assume true; 6927#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6925#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);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; 6923#L30 assume ((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 6450#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6931#L606-3 assume true; 6930#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6928#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);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; 6926#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 6924#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 6922#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 6920#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 6918#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 6916#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 6914#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 6912#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 6910#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 6908#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 6906#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 6904#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 6902#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 6900#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 6898#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 6896#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 6894#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 6892#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 6890#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 6888#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 6886#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 6884#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 6882#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 6880#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 6878#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 6876#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 6874#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 6872#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 6870#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 6868#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 6866#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 6864#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 6862#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 6860#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 6858#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 6856#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 6854#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 6852#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 6850#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 6848#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 6846#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 6844#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 6842#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 6840#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 6838#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 6836#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 6832#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 6833#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-10 08:08:44,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:44,463 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-10 08:08:44,463 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:44,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:44,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:44,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:08:44,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:44,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:08:44,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:08:44,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:44,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1219893882, now seen corresponding path program 1 times [2018-11-10 08:08:44,467 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:44,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:44,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:44,468 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:08:44,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:08:44,499 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-10 08:08:44,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:08:44,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:08:44,500 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 08:08:44,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:08:44,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:08:44,500 INFO L87 Difference]: Start difference. First operand 1508 states and 1998 transitions. cyclomatic complexity: 492 Second operand 3 states. [2018-11-10 08:08:44,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:08:44,847 INFO L93 Difference]: Finished difference Result 1507 states and 1821 transitions. [2018-11-10 08:08:44,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:08:44,849 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1507 states and 1821 transitions. [2018-11-10 08:08:44,856 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-10 08:08:44,862 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1507 states to 1507 states and 1821 transitions. [2018-11-10 08:08:44,862 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1507 [2018-11-10 08:08:44,863 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1507 [2018-11-10 08:08:44,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1507 states and 1821 transitions. [2018-11-10 08:08:44,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 08:08:44,865 INFO L705 BuchiCegarLoop]: Abstraction has 1507 states and 1821 transitions. [2018-11-10 08:08:44,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states and 1821 transitions. [2018-11-10 08:08:44,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1507. [2018-11-10 08:08:44,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2018-11-10 08:08:44,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1821 transitions. [2018-11-10 08:08:44,884 INFO L728 BuchiCegarLoop]: Abstraction has 1507 states and 1821 transitions. [2018-11-10 08:08:44,884 INFO L608 BuchiCegarLoop]: Abstraction has 1507 states and 1821 transitions. [2018-11-10 08:08:44,884 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 08:08:44,884 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1507 states and 1821 transitions. [2018-11-10 08:08:44,889 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-10 08:08:44,889 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:08:44,889 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:08:44,890 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 08:08:44,890 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-10 08:08:44,891 INFO L793 eck$LassoCheckResult]: Stem: 9454#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-10 08:08:44,891 INFO L795 eck$LassoCheckResult]: Loop: 9329#L606-3 assume true; 10221#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 10219#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);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; 10217#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 10215#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 10213#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 10211#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 10210#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 10208#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 10206#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 10204#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 10202#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 10200#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 10198#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 10196#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 10194#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 10192#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 10190#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 9901#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 9902#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 10119#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 10117#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 10115#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 10113#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 10111#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 10109#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 10107#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 10105#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 10103#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 9796#L165 assume (~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1);~a25~0 := 1;~a28~0 := 9;calculate_output_#res := 26; 9686#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9789#L606-3 assume true; 9787#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 9785#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);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; 9783#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 9781#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 9779#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 9777#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 9775#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 9773#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 9771#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 9769#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 9767#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 9765#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 9763#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 9761#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 9759#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 9757#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 9755#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 9753#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 9751#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 9749#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 9747#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 9745#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 9743#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 9741#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 9739#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 9737#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 9735#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 9732#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 9730#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 9728#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 9726#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 9724#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 9722#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 9720#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 9718#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 9716#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 9714#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 9712#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 9710#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 9708#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 9706#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 9704#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 9702#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 9700#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 9698#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 9696#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 9694#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 9692#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 9689#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 9690#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-10 08:08:44,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:44,891 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-10 08:08:44,891 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:44,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:44,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:44,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:08:44,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:44,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:08:44,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:08:44,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:44,895 INFO L82 PathProgramCache]: Analyzing trace with hash -606648447, now seen corresponding path program 1 times [2018-11-10 08:08:44,895 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:44,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:44,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:44,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:08:44,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:44,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:08:44,956 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-10 08:08:44,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:08:44,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:08:44,958 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 08:08:44,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:08:44,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:08:44,961 INFO L87 Difference]: Start difference. First operand 1507 states and 1821 transitions. cyclomatic complexity: 316 Second operand 3 states. [2018-11-10 08:08:45,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:08:45,208 INFO L93 Difference]: Finished difference Result 1496 states and 1777 transitions. [2018-11-10 08:08:45,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:08:45,208 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1496 states and 1777 transitions. [2018-11-10 08:08:45,214 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-10 08:08:45,219 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1496 states to 1496 states and 1777 transitions. [2018-11-10 08:08:45,219 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1496 [2018-11-10 08:08:45,221 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1496 [2018-11-10 08:08:45,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1496 states and 1777 transitions. [2018-11-10 08:08:45,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 08:08:45,223 INFO L705 BuchiCegarLoop]: Abstraction has 1496 states and 1777 transitions. [2018-11-10 08:08:45,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states and 1777 transitions. [2018-11-10 08:08:45,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1496. [2018-11-10 08:08:45,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2018-11-10 08:08:45,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 1777 transitions. [2018-11-10 08:08:45,245 INFO L728 BuchiCegarLoop]: Abstraction has 1496 states and 1777 transitions. [2018-11-10 08:08:45,245 INFO L608 BuchiCegarLoop]: Abstraction has 1496 states and 1777 transitions. [2018-11-10 08:08:45,245 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 08:08:45,245 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1496 states and 1777 transitions. [2018-11-10 08:08:45,250 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-10 08:08:45,251 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:08:45,251 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:08:45,251 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 08:08:45,252 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-10 08:08:45,252 INFO L793 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-10 08:08:45,253 INFO L795 eck$LassoCheckResult]: Loop: 12338#L606-3 assume true; 13772#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 13771#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);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; 13770#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 13769#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 13767#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 12400#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 12401#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 12571#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 13267#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 13811#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 13810#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 13809#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 13808#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 13807#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 13805#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 13803#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 13801#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 13799#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 13797#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 13795#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 13793#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 13791#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 13790#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 13789#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 13788#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13743#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 13391#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 13390#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 12856#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 12857#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 13057#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 13055#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 13053#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 13052#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 13050#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 13048#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 13046#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 13044#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 13042#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 13040#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 13038#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 13036#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 13034#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 13032#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 13031#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 13029#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 13027#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 13025#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 13023#L253 assume !((~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9); 13021#L259 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && (((~a28~0 == 9 && calculate_output_~input == 6) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a25~0 == 1)); 13019#L261 assume !(~a17~0 == 9 && ~a21~0 == 1 && ~a11~0 == 1 && (calculate_output_~input == 3 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7))) && ~a19~0 == 1); 13017#L276 assume !(~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && ~a21~0 == 1 && ~a19~0 == 1 && calculate_output_~input == 5 && !(~a11~0 == 1)); 13015#L280 assume !(~a28~0 == 8 && ~a21~0 == 1 && (!(~a11~0 == 1) && (calculate_output_~input == 1 && ~a17~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 13013#L283 assume !((((~a17~0 == 8 && (calculate_output_~input == 6 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a21~0 == 1) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a19~0 == 1); 13011#L286 assume !((!(~a11~0 == 1) && (!(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 11) || (~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 13009#L291 assume !(~a17~0 == 8 && (~a21~0 == 1 && !(~a11~0 == 1) && ~a25~0 == 1 && ~a28~0 == 8 && calculate_output_~input == 6) && ~a19~0 == 1); 13007#L293 assume !((~a19~0 == 1 && ~a17~0 == 8 && ((!(~a25~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11); 13005#L297 assume !(~a11~0 == 1 && (~a17~0 == 9 && ~a28~0 == 9 && ~a19~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a21~0 == 1); 13003#L309 assume !((((((calculate_output_~input == 3 && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a28~0 == 11) && !(~a11~0 == 1)); 13001#L314 assume !(~a19~0 == 1 && ~a21~0 == 1 && ((calculate_output_~input == 5 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7))) && ~a11~0 == 1) && ~a17~0 == 9); 12999#L328 assume !((~a19~0 == 1 && ((!(~a11~0 == 1) && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a28~0 == 10) && ~a21~0 == 1) && ~a17~0 == 8); 12997#L331 assume !((!(~a11~0 == 1) && (((calculate_output_~input == 4 && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1); 12996#L337 assume !(((!(~a19~0 == 1) && (calculate_output_~input == 4 && (((!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 12994#L349 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && ((~a25~0 == 1 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 11) && ~a21~0 == 1); 12992#L354 assume !((((~a21~0 == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a28~0 == 9 && ~a25~0 == 1)) && calculate_output_~input == 6) && !(~a11~0 == 1)) && !(~a19~0 == 1)) && ~a17~0 == 8); 12990#L361 assume !(~a19~0 == 1 && ((~a21~0 == 1 && (!(~a25~0 == 1) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a28~0 == 8) && ~a11~0 == 1); 12988#L368 assume !(~a17~0 == 8 && (~a21~0 == 1 && (calculate_output_~input == 5 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a28~0 == 9 && ~a25~0 == 1))) && ~a19~0 == 1) && !(~a11~0 == 1)); 12986#L375 assume !(~a19~0 == 1 && (((~a17~0 == 8 && calculate_output_~input == 5 && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a25~0 == 1) && ~a28~0 == 8); 12984#L378 assume !(((!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 4) && ~a28~0 == 10) && ~a17~0 == 8) && !(~a19~0 == 1)) && ~a25~0 == 1); 12983#L380 assume !(~a28~0 == 8 && (~a19~0 == 1 && ~a11~0 == 1 && !(~a25~0 == 1) && ~a17~0 == 9 && calculate_output_~input == 6) && ~a21~0 == 1); 12981#L389 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 6 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a17~0 == 8) && !(~a19~0 == 1)); 12980#L394 assume !(((((!(~a25~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 9) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 12978#L398 assume !((~a17~0 == 8 && ((calculate_output_~input == 4 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)); 12976#L402 assume !(((!(~a11~0 == 1) && ((~a19~0 == 1 && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)); 12974#L404 assume !((~a11~0 == 1 && ~a19~0 == 1 && ~a21~0 == 1 && (~a17~0 == 9 && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a28~0 == 8); 12972#L407 assume !(!(~a11~0 == 1) && ~a21~0 == 1 && (~a19~0 == 1 && ~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 5) && ~a28~0 == 11); 12970#L409 assume !(~a19~0 == 1 && ~a17~0 == 8 && ((((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3) && !(~a11~0 == 1)) && ~a21~0 == 1); 12968#L414 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 12966#L414-2 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 12964#L417-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 12963#L420-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 12962#L423-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 12961#L426-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 12960#L429-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 12958#L432-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 12956#L435-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 12354#L438-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 12551#L441-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 12386#L444-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 12387#L447-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 12355#L450-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 12356#L453-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 12499#L456-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 12500#L459-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 12619#L462-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13667#L465-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 12546#L468-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13711#L471-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13710#L474-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13709#L477-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13707#L480-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13705#L483-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13703#L486-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13701#L489-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13699#L492-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13697#L495-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13695#L498-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13693#L501-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13691#L504-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13689#L507-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13687#L510-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13684#L513-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 12484#L516-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13806#L519-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13804#L522-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13802#L525-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13800#L528-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13798#L531-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13796#L534-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13794#L537-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13792#L540-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13744#L543-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 12540#L546-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 12541#L549-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13783#L552-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13781#L555-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13779#L558-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13777#L561-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13746#L564-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13745#L567-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 12572#L570-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 12573#L573-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13762#L576-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13760#L579-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13758#L582-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13755#L585-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 12329#L588-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 12330#L591-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13774#L594-1 calculate_output_#res := -2; 13773#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-10 08:08:45,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:45,253 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-10 08:08:45,253 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:45,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:45,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:45,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:08:45,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:45,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:08:45,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:08:45,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:45,258 INFO L82 PathProgramCache]: Analyzing trace with hash 245249823, now seen corresponding path program 1 times [2018-11-10 08:08:45,258 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:45,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:45,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:45,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:08:45,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:45,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:08:45,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:08:45,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:45,301 INFO L82 PathProgramCache]: Analyzing trace with hash -2003304803, now seen corresponding path program 1 times [2018-11-10 08:08:45,301 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:45,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:45,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:45,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:08:45,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:45,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:08:45,735 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-10 08:08:45,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:08:45,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 08:08:46,364 WARN L179 SmtUtils]: Spent 617.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2018-11-10 08:08:46,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 08:08:46,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-10 08:08:46,443 INFO L87 Difference]: Start difference. First operand 1496 states and 1777 transitions. cyclomatic complexity: 284 Second operand 10 states. [2018-11-10 08:08:47,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:08:47,141 INFO L93 Difference]: Finished difference Result 1688 states and 1966 transitions. [2018-11-10 08:08:47,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 08:08:47,141 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1688 states and 1966 transitions. [2018-11-10 08:08:47,147 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1632 [2018-11-10 08:08:47,153 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1688 states to 1688 states and 1966 transitions. [2018-11-10 08:08:47,153 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1688 [2018-11-10 08:08:47,154 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1688 [2018-11-10 08:08:47,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1688 states and 1966 transitions. [2018-11-10 08:08:47,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 08:08:47,157 INFO L705 BuchiCegarLoop]: Abstraction has 1688 states and 1966 transitions. [2018-11-10 08:08:47,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states and 1966 transitions. [2018-11-10 08:08:47,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1546. [2018-11-10 08:08:47,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2018-11-10 08:08:47,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 1824 transitions. [2018-11-10 08:08:47,177 INFO L728 BuchiCegarLoop]: Abstraction has 1546 states and 1824 transitions. [2018-11-10 08:08:47,177 INFO L608 BuchiCegarLoop]: Abstraction has 1546 states and 1824 transitions. [2018-11-10 08:08:47,177 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 08:08:47,177 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1546 states and 1824 transitions. [2018-11-10 08:08:47,182 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1490 [2018-11-10 08:08:47,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:08:47,182 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:08:47,182 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:08:47,183 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:08:47,183 INFO L793 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; 16619#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16617#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);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; 16615#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 16613#L35 assume ~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1);~a28~0 := 10;calculate_output_#res := 22; 15807#L597 [2018-11-10 08:08:47,183 INFO L795 eck$LassoCheckResult]: Loop: 15807#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 17058#L606-3 assume true; 17057#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 17056#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);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; 17055#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 17054#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 17053#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 17052#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 17051#L47 assume ((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10;~a25~0 := 0;calculate_output_#res := -1; 15807#L597 [2018-11-10 08:08:47,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:47,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1805984299, now seen corresponding path program 1 times [2018-11-10 08:08:47,183 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:47,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:47,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:47,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:08:47,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:47,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:08:47,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:08:47,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:47,190 INFO L82 PathProgramCache]: Analyzing trace with hash -278812021, now seen corresponding path program 1 times [2018-11-10 08:08:47,190 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:47,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:47,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:47,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:08:47,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:47,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:08:47,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:08:47,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:47,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1569761375, now seen corresponding path program 1 times [2018-11-10 08:08:47,195 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:47,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:47,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:47,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:08:47,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:47,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:08:47,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:08:47,399 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:08:47,399 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:08:47,399 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:08:47,400 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:08:47,400 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 08:08:47,400 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:47,400 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:08:47,400 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:08:47,400 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label45_false-unreach-call_false-termination.c_Iteration8_Lasso [2018-11-10 08:08:47,400 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:08:47,400 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:08:47,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,616 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:08:47,616 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d99cc12-a71f-463d-a694-d670d726d023/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-10 08:08:47,620 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:47,620 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:47,622 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:47,622 INFO L446 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_3d99cc12-a71f-463d-a694-d670d726d023/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-10 08:08:47,640 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:47,640 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:47,658 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:47,658 INFO L446 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_3d99cc12-a71f-463d-a694-d670d726d023/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-10 08:08:47,663 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:47,663 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:47,666 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:47,666 INFO L446 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_3d99cc12-a71f-463d-a694-d670d726d023/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-10 08:08:47,687 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:47,687 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:47,690 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:47,690 INFO L446 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_3d99cc12-a71f-463d-a694-d670d726d023/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-10 08:08:47,708 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:47,709 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:47,711 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:47,711 INFO L446 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_3d99cc12-a71f-463d-a694-d670d726d023/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-10 08:08:47,729 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:47,729 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:47,748 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:47,748 INFO L446 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_3d99cc12-a71f-463d-a694-d670d726d023/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-10 08:08:47,751 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:47,751 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:47,754 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:47,754 INFO L446 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_3d99cc12-a71f-463d-a694-d670d726d023/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-10 08:08:47,772 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:47,773 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:47,791 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:47,791 INFO L446 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_3d99cc12-a71f-463d-a694-d670d726d023/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-10 08:08:47,798 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:47,798 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:47,817 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:47,817 INFO L446 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_3d99cc12-a71f-463d-a694-d670d726d023/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-10 08:08:47,820 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:47,820 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:47,823 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:47,824 INFO L446 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_3d99cc12-a71f-463d-a694-d670d726d023/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-10 08:08:47,842 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:47,842 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:47,860 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:47,860 INFO L446 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_3d99cc12-a71f-463d-a694-d670d726d023/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-10 08:08:47,863 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:47,863 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:47,880 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:47,880 INFO L446 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_3d99cc12-a71f-463d-a694-d670d726d023/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-10 08:08:47,884 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:47,884 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:47,890 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:47,891 INFO L446 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_3d99cc12-a71f-463d-a694-d670d726d023/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-10 08:08:47,907 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:47,908 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:47,910 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:47,910 INFO L446 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_3d99cc12-a71f-463d-a694-d670d726d023/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-10 08:08:47,926 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:47,926 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:47,942 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:47,942 INFO L446 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_3d99cc12-a71f-463d-a694-d670d726d023/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-10 08:08:47,946 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:47,946 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d99cc12-a71f-463d-a694-d670d726d023/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-10 08:08:47,966 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 08:08:47,966 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:48,163 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:48,163 INFO L446 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=4, ULTIMATE.start_calculate_output_~input=3, ULTIMATE.start_main_~input~0=5, ULTIMATE.start_main_#t~nondet2=0}, {ULTIMATE.start_calculate_output_#in~input=-4, ULTIMATE.start_calculate_output_~input=-3, ULTIMATE.start_main_~input~0=-5, ULTIMATE.start_main_#t~nondet2=0}, {ULTIMATE.start_calculate_output_#in~input=-5, ULTIMATE.start_calculate_output_~input=-5, ULTIMATE.start_main_~input~0=-5, ULTIMATE.start_main_#t~nondet2=0}] Lambdas: [1, 0, 0] Nus: [1, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d99cc12-a71f-463d-a694-d670d726d023/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-10 08:08:48,179 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:48,179 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:48,182 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:48,182 INFO L446 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_3d99cc12-a71f-463d-a694-d670d726d023/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-10 08:08:48,198 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:48,198 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d99cc12-a71f-463d-a694-d670d726d023/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-10 08:08:48,226 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 08:08:48,227 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:48,375 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:48,375 INFO L446 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_3d99cc12-a71f-463d-a694-d670d726d023/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-10 08:08:48,392 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:48,392 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:48,408 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:48,408 INFO L446 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_3d99cc12-a71f-463d-a694-d670d726d023/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-10 08:08:48,414 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:48,414 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:48,417 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:48,417 INFO L446 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_3d99cc12-a71f-463d-a694-d670d726d023/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-10 08:08:48,432 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:48,433 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:48,435 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:48,435 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a28~0=0} Honda state: {~a28~0=10} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2018-11-10 08:08:48,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 08:08:48 BoogieIcfgContainer [2018-11-10 08:08:48,470 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 08:08:48,471 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 08:08:48,471 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 08:08:48,471 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 08:08:48,472 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:08:38" (3/4) ... [2018-11-10 08:08:48,475 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-10 08:08:48,514 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3d99cc12-a71f-463d-a694-d670d726d023/bin-2019/uautomizer/witness.graphml [2018-11-10 08:08:48,514 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 08:08:48,515 INFO L168 Benchmark]: Toolchain (without parser) took 10939.38 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 487.6 MB). Free memory was 952.3 MB in the beginning and 1.4 GB in the end (delta: -479.6 MB). Peak memory consumption was 8.0 MB. Max. memory is 11.5 GB. [2018-11-10 08:08:48,516 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 08:08:48,516 INFO L168 Benchmark]: CACSL2BoogieTranslator took 352.92 ms. Allocated memory is still 1.0 GB. Free memory was 952.3 MB in the beginning and 920.0 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2018-11-10 08:08:48,516 INFO L168 Benchmark]: Boogie Procedure Inliner took 90.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 920.0 MB in the beginning and 1.1 GB in the end (delta: -213.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-11-10 08:08:48,516 INFO L168 Benchmark]: Boogie Preprocessor took 38.99 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-10 08:08:48,517 INFO L168 Benchmark]: RCFGBuilder took 923.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 107.1 MB). Peak memory consumption was 107.1 MB. Max. memory is 11.5 GB. [2018-11-10 08:08:48,517 INFO L168 Benchmark]: BuchiAutomizer took 9487.00 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 346.6 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -410.8 MB). Peak memory consumption was 516.6 MB. Max. memory is 11.5 GB. [2018-11-10 08:08:48,517 INFO L168 Benchmark]: Witness Printer took 43.43 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: 309.3 kB). Peak memory consumption was 309.3 kB. Max. memory is 11.5 GB. [2018-11-10 08:08:48,520 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 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 352.92 ms. Allocated memory is still 1.0 GB. Free memory was 952.3 MB in the beginning and 920.0 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 90.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 920.0 MB in the beginning and 1.1 GB in the end (delta: -213.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.99 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 923.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 107.1 MB). Peak memory consumption was 107.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9487.00 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 346.6 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -410.8 MB). Peak memory consumption was 516.6 MB. Max. memory is 11.5 GB. * Witness Printer took 43.43 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: 309.3 kB). Peak memory consumption was 309.3 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.4s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 5.6s. Construction of modules took 2.5s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 147 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 1546 states and ocurred in iteration 7. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1469 SDtfs, 3081 SDslu, 490 SDs, 0 SdLazy, 3703 SolverSat, 847 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time LassoAnalysisResults: nont1 unkn0 SFLI4 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital65 mio100 ax100 hnf103 lsp39 ukn90 mio100 lsp100 div100 bol100 ite100 ukn100 eq209 hnf93 smp100 dnf148 smp89 tf102 neg98 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 69ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 0 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 31 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.9s - 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@4be1c285=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1934dc09=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@4be1c285=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1934dc09=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@4be1c285=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@1934dc09=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 4 + -4*0^k + -4*k + -5*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 5 + -5*0^k + -5*k + -5*0^k, input=6 + sum_{k=0}^i 3 + -3*0^k + -3*k + -5*0^k} - StatisticsResult: NonterminationArgumentStatistics Unbounded Execution 6GEVs Lambdas: [1, 0, 0, 0, 0, 0] Mus: [1, 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...