./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/systemc/kundu2_false-unreach-call_false-termination.cil.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_270d281e-1610-47b1-941d-32db288cdcd7/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_270d281e-1610-47b1-941d-32db288cdcd7/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_270d281e-1610-47b1-941d-32db288cdcd7/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_270d281e-1610-47b1-941d-32db288cdcd7/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/kundu2_false-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_270d281e-1610-47b1-941d-32db288cdcd7/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_270d281e-1610-47b1-941d-32db288cdcd7/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 2559ce56d5bdfaeec5255956226223494fe099f5 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 03:37:52,491 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 03:37:52,492 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 03:37:52,498 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 03:37:52,499 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 03:37:52,499 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 03:37:52,500 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 03:37:52,501 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 03:37:52,503 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 03:37:52,503 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 03:37:52,504 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 03:37:52,504 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 03:37:52,505 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 03:37:52,506 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 03:37:52,506 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 03:37:52,507 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 03:37:52,508 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 03:37:52,509 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 03:37:52,511 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 03:37:52,512 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 03:37:52,513 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 03:37:52,514 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 03:37:52,515 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 03:37:52,515 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 03:37:52,515 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 03:37:52,516 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 03:37:52,517 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 03:37:52,517 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 03:37:52,518 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 03:37:52,518 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 03:37:52,519 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 03:37:52,519 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 03:37:52,519 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 03:37:52,519 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 03:37:52,520 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 03:37:52,521 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 03:37:52,521 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_270d281e-1610-47b1-941d-32db288cdcd7/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 03:37:52,531 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 03:37:52,531 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 03:37:52,532 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 03:37:52,532 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 03:37:52,532 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 03:37:52,533 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 03:37:52,533 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 03:37:52,533 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 03:37:52,533 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 03:37:52,533 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 03:37:52,533 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 03:37:52,533 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 03:37:52,534 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 03:37:52,534 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 03:37:52,534 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 03:37:52,534 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 03:37:52,534 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 03:37:52,534 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 03:37:52,534 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 03:37:52,534 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 03:37:52,535 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 03:37:52,535 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 03:37:52,535 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 03:37:52,535 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 03:37:52,535 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 03:37:52,535 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 03:37:52,535 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 03:37:52,535 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 03:37:52,536 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 03:37:52,536 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 03:37:52,536 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 03:37:52,537 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_270d281e-1610-47b1-941d-32db288cdcd7/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 -> 2559ce56d5bdfaeec5255956226223494fe099f5 [2018-11-10 03:37:52,563 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 03:37:52,571 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 03:37:52,573 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 03:37:52,575 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 03:37:52,575 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 03:37:52,575 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_270d281e-1610-47b1-941d-32db288cdcd7/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/kundu2_false-unreach-call_false-termination.cil.c [2018-11-10 03:37:52,619 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_270d281e-1610-47b1-941d-32db288cdcd7/bin-2019/uautomizer/data/b0b4ee985/ebbdffd033ee4a8fb3df87da40c5bb4c/FLAG5cfe8992d [2018-11-10 03:37:53,031 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 03:37:53,032 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_270d281e-1610-47b1-941d-32db288cdcd7/sv-benchmarks/c/systemc/kundu2_false-unreach-call_false-termination.cil.c [2018-11-10 03:37:53,037 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_270d281e-1610-47b1-941d-32db288cdcd7/bin-2019/uautomizer/data/b0b4ee985/ebbdffd033ee4a8fb3df87da40c5bb4c/FLAG5cfe8992d [2018-11-10 03:37:53,045 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_270d281e-1610-47b1-941d-32db288cdcd7/bin-2019/uautomizer/data/b0b4ee985/ebbdffd033ee4a8fb3df87da40c5bb4c [2018-11-10 03:37:53,047 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 03:37:53,048 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 03:37:53,048 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 03:37:53,048 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 03:37:53,051 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 03:37:53,051 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:37:53" (1/1) ... [2018-11-10 03:37:53,053 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@631487cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:37:53, skipping insertion in model container [2018-11-10 03:37:53,053 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:37:53" (1/1) ... [2018-11-10 03:37:53,060 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 03:37:53,086 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 03:37:53,244 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:37:53,248 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 03:37:53,279 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:37:53,291 INFO L193 MainTranslator]: Completed translation [2018-11-10 03:37:53,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:37:53 WrapperNode [2018-11-10 03:37:53,292 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 03:37:53,292 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 03:37:53,292 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 03:37:53,292 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 03:37:53,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:37:53" (1/1) ... [2018-11-10 03:37:53,303 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:37:53" (1/1) ... [2018-11-10 03:37:53,328 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 03:37:53,329 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 03:37:53,329 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 03:37:53,329 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 03:37:53,383 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:37:53" (1/1) ... [2018-11-10 03:37:53,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:37:53" (1/1) ... [2018-11-10 03:37:53,386 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:37:53" (1/1) ... [2018-11-10 03:37:53,386 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:37:53" (1/1) ... [2018-11-10 03:37:53,392 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:37:53" (1/1) ... [2018-11-10 03:37:53,401 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:37:53" (1/1) ... [2018-11-10 03:37:53,403 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:37:53" (1/1) ... [2018-11-10 03:37:53,407 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 03:37:53,407 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 03:37:53,407 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 03:37:53,407 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 03:37:53,409 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:37:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_270d281e-1610-47b1-941d-32db288cdcd7/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 03:37:53,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 03:37:53,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 03:37:53,869 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 03:37:53,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:37:53 BoogieIcfgContainer [2018-11-10 03:37:53,869 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 03:37:53,870 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 03:37:53,870 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 03:37:53,872 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 03:37:53,873 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:37:53,873 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 03:37:53" (1/3) ... [2018-11-10 03:37:53,873 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@231b42e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 03:37:53, skipping insertion in model container [2018-11-10 03:37:53,873 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:37:53,874 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:37:53" (2/3) ... [2018-11-10 03:37:53,874 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@231b42e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 03:37:53, skipping insertion in model container [2018-11-10 03:37:53,874 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:37:53,874 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:37:53" (3/3) ... [2018-11-10 03:37:53,875 INFO L375 chiAutomizerObserver]: Analyzing ICFG kundu2_false-unreach-call_false-termination.cil.c [2018-11-10 03:37:53,917 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 03:37:53,918 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 03:37:53,918 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 03:37:53,918 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 03:37:53,918 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 03:37:53,918 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 03:37:53,918 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 03:37:53,918 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 03:37:53,919 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 03:37:53,929 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 195 states. [2018-11-10 03:37:53,948 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 158 [2018-11-10 03:37:53,948 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:37:53,948 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:37:53,954 INFO L866 BuchiCegarLoop]: Counterexample stem 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] [2018-11-10 03:37:53,954 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] [2018-11-10 03:37:53,955 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 03:37:53,955 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 195 states. [2018-11-10 03:37:53,958 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 158 [2018-11-10 03:37:53,958 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:37:53,959 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:37:53,960 INFO L866 BuchiCegarLoop]: Counterexample stem 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] [2018-11-10 03:37:53,960 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] [2018-11-10 03:37:53,965 INFO L793 eck$LassoCheckResult]: Stem: 89#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 86#L589true assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 148#L287true assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 181#L294true assume !(~P_1_i~0 == 1);~P_1_st~0 := 2; 190#L294-2true assume ~P_2_i~0 == 1;~P_2_st~0 := 0; 132#L299-1true assume !(~C_1_i~0 == 1);~C_1_st~0 := 2; 139#L304-1true assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 76#L413true assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 185#L107true assume !(~P_1_pc~0 == 1); 168#L107-2true is_P_1_triggered_~__retres1~0 := 0; 187#L118true is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 68#L119true activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 114#L467true assume activate_threads_~tmp~1 != 0;~P_1_st~0 := 0; 118#L467-2true assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 3#L175true assume ~P_2_pc~0 == 1; 84#L176true assume ~P_2_ev~0 == 1;is_P_2_triggered_~__retres1~1 := 1; 4#L186true is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 85#L187true activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 134#L475true assume !(activate_threads_~tmp___0~1 != 0); 124#L475-2true assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 55#L257true assume ~C_1_pc~0 == 1; 119#L258true assume ~e~0 == 1;is_C_1_triggered_~__retres1~2 := 1; 176#L278true is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 57#L279true activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 22#L483true assume !(activate_threads_~tmp___1~1 != 0); 27#L483-2true assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 180#L421true assume { :end_inline_reset_delta_events } true; 152#L537-3true [2018-11-10 03:37:53,965 INFO L795 eck$LassoCheckResult]: Loop: 152#L537-3true assume true; 150#L537-1true assume !false; 37#L538true start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 144#L386true assume !true; 77#L402true assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 143#L287-1true assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 78#L413-1true assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 162#L107-6true assume !(~P_1_pc~0 == 1); 178#L107-8true is_P_1_triggered_~__retres1~0 := 0; 170#L118-2true is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 62#L119-2true activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 102#L467-6true assume !(activate_threads_~tmp~1 != 0); 107#L467-8true assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 109#L175-6true assume !(~P_2_pc~0 == 1); 105#L175-8true is_P_2_triggered_~__retres1~1 := 0; 17#L186-2true is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 94#L187-2true activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 129#L475-6true assume activate_threads_~tmp___0~1 != 0;~P_2_st~0 := 0; 195#L475-8true assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 23#L257-6true assume ~C_1_pc~0 == 1; 115#L258-2true assume ~e~0 == 1;is_C_1_triggered_~__retres1~2 := 1; 156#L278-2true is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 52#L279-2true activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 12#L483-6true assume activate_threads_~tmp___1~1 != 0;~C_1_st~0 := 0; 18#L483-8true assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 161#L421-1true assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 69#L317-1true assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 42#L334-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 101#L335-1true start_simulation_#t~ret9 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 87#L556true assume !(start_simulation_~tmp~3 == 0); 88#L556-2true assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 72#L317-2true assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 44#L334-2true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 103#L335-2true stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 6#L511true assume stop_simulation_~tmp~2 != 0;stop_simulation_~__retres2~0 := 0; 149#L518true stop_simulation_#res := stop_simulation_~__retres2~0; 133#L519true start_simulation_#t~ret10 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 192#L569true assume !(start_simulation_~tmp___0~2 != 0); 152#L537-3true [2018-11-10 03:37:53,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:37:53,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1332213672, now seen corresponding path program 1 times [2018-11-10 03:37:53,971 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:37:53,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:37:54,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:54,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:37:54,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:54,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:37:54,065 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 03:37:54,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:37:54,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:37:54,071 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:37:54,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:37:54,071 INFO L82 PathProgramCache]: Analyzing trace with hash -799421162, now seen corresponding path program 1 times [2018-11-10 03:37:54,071 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:37:54,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:37:54,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:54,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:37:54,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:54,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:37:54,081 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 03:37:54,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:37:54,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 03:37:54,082 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:37:54,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:37:54,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:37:54,095 INFO L87 Difference]: Start difference. First operand 195 states. Second operand 3 states. [2018-11-10 03:37:54,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:37:54,115 INFO L93 Difference]: Finished difference Result 191 states and 273 transitions. [2018-11-10 03:37:54,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:37:54,117 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 191 states and 273 transitions. [2018-11-10 03:37:54,120 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 150 [2018-11-10 03:37:54,124 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 191 states to 183 states and 265 transitions. [2018-11-10 03:37:54,125 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 183 [2018-11-10 03:37:54,126 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 183 [2018-11-10 03:37:54,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 183 states and 265 transitions. [2018-11-10 03:37:54,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:37:54,127 INFO L705 BuchiCegarLoop]: Abstraction has 183 states and 265 transitions. [2018-11-10 03:37:54,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states and 265 transitions. [2018-11-10 03:37:54,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-11-10 03:37:54,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-11-10 03:37:54,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 265 transitions. [2018-11-10 03:37:54,153 INFO L728 BuchiCegarLoop]: Abstraction has 183 states and 265 transitions. [2018-11-10 03:37:54,153 INFO L608 BuchiCegarLoop]: Abstraction has 183 states and 265 transitions. [2018-11-10 03:37:54,153 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 03:37:54,153 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 183 states and 265 transitions. [2018-11-10 03:37:54,155 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 150 [2018-11-10 03:37:54,155 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:37:54,155 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:37:54,156 INFO L866 BuchiCegarLoop]: Counterexample stem 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] [2018-11-10 03:37:54,156 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] [2018-11-10 03:37:54,156 INFO L793 eck$LassoCheckResult]: Stem: 559#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 422#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 423#L589 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 522#L287 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 523#L294 assume ~P_1_i~0 == 1;~P_1_st~0 := 0; 567#L294-2 assume ~P_2_i~0 == 1;~P_2_st~0 := 0; 426#L299-1 assume !(~C_1_i~0 == 1);~C_1_st~0 := 2; 427#L304-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 488#L413 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 548#L107 assume !(~P_1_pc~0 == 1); 538#L107-2 is_P_1_triggered_~__retres1~0 := 0; 537#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 540#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 541#L467 assume activate_threads_~tmp~1 != 0;~P_1_st~0 := 0; 576#L467-2 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 395#L175 assume ~P_2_pc~0 == 1; 396#L176 assume ~P_2_ev~0 == 1;is_P_2_triggered_~__retres1~1 := 1; 398#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 399#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 446#L475 assume !(activate_threads_~tmp___0~1 != 0); 400#L475-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 401#L257 assume ~C_1_pc~0 == 1; 512#L258 assume ~e~0 == 1;is_C_1_triggered_~__retres1~2 := 1; 513#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 514#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 451#L483 assume !(activate_threads_~tmp___1~1 != 0); 452#L483-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 462#L421 assume { :end_inline_reset_delta_events } true; 546#L537-3 [2018-11-10 03:37:54,156 INFO L795 eck$LassoCheckResult]: Loop: 546#L537-3 assume true; 545#L537-1 assume !false; 487#L538 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 484#L386 assume true; 516#L346-1 assume !false; 551#L347 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 535#L317 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 408#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 493#L335 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 472#L351 assume !(eval_~tmp___2~0 != 0); 473#L402 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 498#L287-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 499#L413-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 549#L107-6 assume ~P_1_pc~0 == 1; 524#L108-2 assume ~P_1_ev~0 == 1;is_P_1_triggered_~__retres1~0 := 1; 525#L118-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 528#L119-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 529#L467-6 assume !(activate_threads_~tmp~1 != 0); 574#L467-8 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 575#L175-6 assume ~P_2_pc~0 == 1; 564#L176-2 assume ~P_2_ev~0 == 1;is_P_2_triggered_~__retres1~1 := 1; 443#L186-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 444#L187-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 413#L475-6 assume activate_threads_~tmp___0~1 != 0;~P_2_st~0 := 0; 414#L475-8 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 453#L257-6 assume ~C_1_pc~0 == 1; 455#L258-2 assume ~e~0 == 1;is_C_1_triggered_~__retres1~2 := 1; 508#L278-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 509#L279-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 433#L483-6 assume activate_threads_~tmp___1~1 != 0;~C_1_st~0 := 0; 434#L483-8 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 445#L421-1 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 539#L317-1 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 411#L334-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 494#L335-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 554#L556 assume !(start_simulation_~tmp~3 == 0); 547#L556-2 assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 544#L317-2 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 418#L334-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 497#L335-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 420#L511 assume stop_simulation_~tmp~2 != 0;stop_simulation_~__retres2~0 := 0; 421#L518 stop_simulation_#res := stop_simulation_~__retres2~0; 439#L519 start_simulation_#t~ret10 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 440#L569 assume !(start_simulation_~tmp___0~2 != 0); 546#L537-3 [2018-11-10 03:37:54,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:37:54,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1466227178, now seen corresponding path program 1 times [2018-11-10 03:37:54,157 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:37:54,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:37:54,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:54,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:37:54,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:54,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:37:54,202 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 03:37:54,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:37:54,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:37:54,203 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:37:54,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:37:54,203 INFO L82 PathProgramCache]: Analyzing trace with hash 469106883, now seen corresponding path program 1 times [2018-11-10 03:37:54,203 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:37:54,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:37:54,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:54,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:37:54,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:54,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:37:54,252 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 03:37:54,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:37:54,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 03:37:54,253 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:37:54,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:37:54,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:37:54,253 INFO L87 Difference]: Start difference. First operand 183 states and 265 transitions. cyclomatic complexity: 83 Second operand 3 states. [2018-11-10 03:37:54,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:37:54,271 INFO L93 Difference]: Finished difference Result 183 states and 264 transitions. [2018-11-10 03:37:54,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:37:54,272 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 183 states and 264 transitions. [2018-11-10 03:37:54,274 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 150 [2018-11-10 03:37:54,275 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 183 states to 183 states and 264 transitions. [2018-11-10 03:37:54,275 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 183 [2018-11-10 03:37:54,276 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 183 [2018-11-10 03:37:54,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 183 states and 264 transitions. [2018-11-10 03:37:54,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:37:54,277 INFO L705 BuchiCegarLoop]: Abstraction has 183 states and 264 transitions. [2018-11-10 03:37:54,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states and 264 transitions. [2018-11-10 03:37:54,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-11-10 03:37:54,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-11-10 03:37:54,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 264 transitions. [2018-11-10 03:37:54,283 INFO L728 BuchiCegarLoop]: Abstraction has 183 states and 264 transitions. [2018-11-10 03:37:54,283 INFO L608 BuchiCegarLoop]: Abstraction has 183 states and 264 transitions. [2018-11-10 03:37:54,283 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 03:37:54,283 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 183 states and 264 transitions. [2018-11-10 03:37:54,285 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 150 [2018-11-10 03:37:54,285 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:37:54,285 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:37:54,286 INFO L866 BuchiCegarLoop]: Counterexample stem 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] [2018-11-10 03:37:54,286 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] [2018-11-10 03:37:54,286 INFO L793 eck$LassoCheckResult]: Stem: 934#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 797#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 798#L589 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 895#L287 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 896#L294 assume ~P_1_i~0 == 1;~P_1_st~0 := 0; 942#L294-2 assume ~P_2_i~0 == 1;~P_2_st~0 := 0; 799#L299-1 assume ~C_1_i~0 == 1;~C_1_st~0 := 0; 800#L304-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 863#L413 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 923#L107 assume !(~P_1_pc~0 == 1); 913#L107-2 is_P_1_triggered_~__retres1~0 := 0; 912#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 914#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 915#L467 assume activate_threads_~tmp~1 != 0;~P_1_st~0 := 0; 951#L467-2 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 770#L175 assume ~P_2_pc~0 == 1; 771#L176 assume ~P_2_ev~0 == 1;is_P_2_triggered_~__retres1~1 := 1; 773#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 774#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 818#L475 assume !(activate_threads_~tmp___0~1 != 0); 775#L475-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 776#L257 assume ~C_1_pc~0 == 1; 887#L258 assume ~e~0 == 1;is_C_1_triggered_~__retres1~2 := 1; 888#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 889#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 826#L483 assume !(activate_threads_~tmp___1~1 != 0); 827#L483-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 837#L421 assume { :end_inline_reset_delta_events } true; 921#L537-3 [2018-11-10 03:37:54,286 INFO L795 eck$LassoCheckResult]: Loop: 921#L537-3 assume true; 920#L537-1 assume !false; 858#L538 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 859#L386 assume true; 891#L346-1 assume !false; 926#L347 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 908#L317 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 783#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 866#L335 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 846#L351 assume !(eval_~tmp___2~0 != 0); 847#L402 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 873#L287-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 874#L413-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 924#L107-6 assume ~P_1_pc~0 == 1; 899#L108-2 assume ~P_1_ev~0 == 1;is_P_1_triggered_~__retres1~0 := 1; 900#L118-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 903#L119-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 904#L467-6 assume !(activate_threads_~tmp~1 != 0); 949#L467-8 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 950#L175-6 assume ~P_2_pc~0 == 1; 939#L176-2 assume ~P_2_ev~0 == 1;is_P_2_triggered_~__retres1~1 := 1; 819#L186-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 820#L187-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 788#L475-6 assume activate_threads_~tmp___0~1 != 0;~P_2_st~0 := 0; 789#L475-8 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 828#L257-6 assume ~C_1_pc~0 == 1; 830#L258-2 assume ~e~0 == 1;is_C_1_triggered_~__retres1~2 := 1; 883#L278-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 884#L279-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 808#L483-6 assume activate_threads_~tmp___1~1 != 0;~C_1_st~0 := 0; 809#L483-8 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 821#L421-1 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 916#L317-1 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 786#L334-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 869#L335-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 929#L556 assume !(start_simulation_~tmp~3 == 0); 922#L556-2 assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 919#L317-2 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 793#L334-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 872#L335-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 795#L511 assume stop_simulation_~tmp~2 != 0;stop_simulation_~__retres2~0 := 0; 796#L518 stop_simulation_#res := stop_simulation_~__retres2~0; 814#L519 start_simulation_#t~ret10 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 815#L569 assume !(start_simulation_~tmp___0~2 != 0); 921#L537-3 [2018-11-10 03:37:54,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:37:54,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1247372460, now seen corresponding path program 1 times [2018-11-10 03:37:54,287 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:37:54,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:37:54,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:54,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:37:54,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:54,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:37:54,314 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 03:37:54,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:37:54,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:37:54,315 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:37:54,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:37:54,315 INFO L82 PathProgramCache]: Analyzing trace with hash 469106883, now seen corresponding path program 2 times [2018-11-10 03:37:54,315 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:37:54,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:37:54,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:54,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:37:54,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:54,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:37:54,349 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 03:37:54,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:37:54,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 03:37:54,349 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:37:54,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:37:54,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:37:54,350 INFO L87 Difference]: Start difference. First operand 183 states and 264 transitions. cyclomatic complexity: 82 Second operand 3 states. [2018-11-10 03:37:54,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:37:54,408 INFO L93 Difference]: Finished difference Result 329 states and 470 transitions. [2018-11-10 03:37:54,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:37:54,409 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 329 states and 470 transitions. [2018-11-10 03:37:54,410 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 297 [2018-11-10 03:37:54,411 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 329 states to 329 states and 470 transitions. [2018-11-10 03:37:54,412 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 329 [2018-11-10 03:37:54,412 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 329 [2018-11-10 03:37:54,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 329 states and 470 transitions. [2018-11-10 03:37:54,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:37:54,413 INFO L705 BuchiCegarLoop]: Abstraction has 329 states and 470 transitions. [2018-11-10 03:37:54,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states and 470 transitions. [2018-11-10 03:37:54,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 313. [2018-11-10 03:37:54,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-11-10 03:37:54,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 448 transitions. [2018-11-10 03:37:54,423 INFO L728 BuchiCegarLoop]: Abstraction has 313 states and 448 transitions. [2018-11-10 03:37:54,423 INFO L608 BuchiCegarLoop]: Abstraction has 313 states and 448 transitions. [2018-11-10 03:37:54,423 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 03:37:54,423 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 313 states and 448 transitions. [2018-11-10 03:37:54,425 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 281 [2018-11-10 03:37:54,425 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:37:54,425 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:37:54,426 INFO L866 BuchiCegarLoop]: Counterexample stem 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] [2018-11-10 03:37:54,426 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] [2018-11-10 03:37:54,426 INFO L793 eck$LassoCheckResult]: Stem: 1460#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 1317#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 1318#L589 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 1418#L287 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 1419#L294 assume ~P_1_i~0 == 1;~P_1_st~0 := 0; 1470#L294-2 assume ~P_2_i~0 == 1;~P_2_st~0 := 0; 1321#L299-1 assume ~C_1_i~0 == 1;~C_1_st~0 := 0; 1322#L304-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 1383#L413 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 1446#L107 assume !(~P_1_pc~0 == 1); 1434#L107-2 is_P_1_triggered_~__retres1~0 := 0; 1433#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 1436#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 1437#L467 assume activate_threads_~tmp~1 != 0;~P_1_st~0 := 0; 1485#L467-2 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 1291#L175 assume !(~P_2_pc~0 == 1); 1292#L175-2 is_P_2_triggered_~__retres1~1 := 0; 1293#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 1294#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 1340#L475 assume !(activate_threads_~tmp___0~1 != 0); 1295#L475-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 1296#L257 assume ~C_1_pc~0 == 1; 1408#L258 assume ~e~0 == 1;is_C_1_triggered_~__retres1~2 := 1; 1409#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 1410#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 1345#L483 assume !(activate_threads_~tmp___1~1 != 0); 1346#L483-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 1356#L421 assume { :end_inline_reset_delta_events } true; 1444#L537-3 [2018-11-10 03:37:54,426 INFO L795 eck$LassoCheckResult]: Loop: 1444#L537-3 assume true; 1443#L537-1 assume !false; 1382#L538 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 1379#L386 assume true; 1412#L346-1 assume !false; 1449#L347 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 1431#L317 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 1303#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 1507#L335 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 1505#L351 assume !(eval_~tmp___2~0 != 0); 1503#L402 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 1501#L287-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 1498#L413-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 1496#L107-6 assume ~P_1_pc~0 == 1; 1493#L108-2 assume ~P_1_ev~0 == 1;is_P_1_triggered_~__retres1~0 := 1; 1492#L118-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 1490#L119-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 1488#L467-6 assume !(activate_threads_~tmp~1 != 0); 1487#L467-8 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 1483#L175-6 assume !(~P_2_pc~0 == 1); 1484#L175-8 is_P_2_triggered_~__retres1~1 := 0; 1603#L186-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 1602#L187-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 1601#L475-6 assume activate_threads_~tmp___0~1 != 0;~P_2_st~0 := 0; 1600#L475-8 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 1599#L257-6 assume ~C_1_pc~0 == 1; 1595#L258-2 assume ~e~0 == 1;is_C_1_triggered_~__retres1~2 := 1; 1594#L278-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 1593#L279-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 1592#L483-6 assume activate_threads_~tmp___1~1 != 0;~C_1_st~0 := 0; 1591#L483-8 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 1590#L421-1 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 1587#L317-1 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 1586#L334-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 1508#L335-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 1506#L556 assume !(start_simulation_~tmp~3 == 0); 1445#L556-2 assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 1440#L317-2 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 1313#L334-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 1393#L335-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 1315#L511 assume stop_simulation_~tmp~2 != 0;stop_simulation_~__retres2~0 := 0; 1316#L518 stop_simulation_#res := stop_simulation_~__retres2~0; 1333#L519 start_simulation_#t~ret10 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 1334#L569 assume !(start_simulation_~tmp___0~2 != 0); 1444#L537-3 [2018-11-10 03:37:54,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:37:54,426 INFO L82 PathProgramCache]: Analyzing trace with hash -31952275, now seen corresponding path program 1 times [2018-11-10 03:37:54,427 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:37:54,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:37:54,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:54,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:37:54,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:54,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:37:54,449 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 03:37:54,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:37:54,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:37:54,450 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:37:54,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:37:54,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1588497148, now seen corresponding path program 1 times [2018-11-10 03:37:54,450 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:37:54,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:37:54,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:54,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:37:54,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:54,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:37:54,481 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 03:37:54,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:37:54,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 03:37:54,482 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:37:54,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:37:54,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:37:54,483 INFO L87 Difference]: Start difference. First operand 313 states and 448 transitions. cyclomatic complexity: 136 Second operand 3 states. [2018-11-10 03:37:54,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:37:54,540 INFO L93 Difference]: Finished difference Result 582 states and 814 transitions. [2018-11-10 03:37:54,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:37:54,540 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 582 states and 814 transitions. [2018-11-10 03:37:54,544 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 552 [2018-11-10 03:37:54,547 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 582 states to 582 states and 814 transitions. [2018-11-10 03:37:54,547 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 582 [2018-11-10 03:37:54,548 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 582 [2018-11-10 03:37:54,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 582 states and 814 transitions. [2018-11-10 03:37:54,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:37:54,550 INFO L705 BuchiCegarLoop]: Abstraction has 582 states and 814 transitions. [2018-11-10 03:37:54,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states and 814 transitions. [2018-11-10 03:37:54,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 566. [2018-11-10 03:37:54,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2018-11-10 03:37:54,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 794 transitions. [2018-11-10 03:37:54,563 INFO L728 BuchiCegarLoop]: Abstraction has 566 states and 794 transitions. [2018-11-10 03:37:54,563 INFO L608 BuchiCegarLoop]: Abstraction has 566 states and 794 transitions. [2018-11-10 03:37:54,563 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 03:37:54,564 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 566 states and 794 transitions. [2018-11-10 03:37:54,566 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 536 [2018-11-10 03:37:54,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:37:54,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:37:54,567 INFO L866 BuchiCegarLoop]: Counterexample stem 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] [2018-11-10 03:37:54,567 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] [2018-11-10 03:37:54,568 INFO L793 eck$LassoCheckResult]: Stem: 2374#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 2221#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 2222#L589 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 2321#L287 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 2322#L294 assume ~P_1_i~0 == 1;~P_1_st~0 := 0; 2384#L294-2 assume ~P_2_i~0 == 1;~P_2_st~0 := 0; 2223#L299-1 assume ~C_1_i~0 == 1;~C_1_st~0 := 0; 2224#L304-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 2285#L413 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 2353#L107 assume !(~P_1_pc~0 == 1); 2340#L107-2 is_P_1_triggered_~__retres1~0 := 0; 2339#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 2342#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 2343#L467 assume activate_threads_~tmp~1 != 0;~P_1_st~0 := 0; 2400#L467-2 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 2195#L175 assume !(~P_2_pc~0 == 1); 2196#L175-2 is_P_2_triggered_~__retres1~1 := 0; 2197#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 2198#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 2242#L475 assume !(activate_threads_~tmp___0~1 != 0); 2199#L475-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 2200#L257 assume !(~C_1_pc~0 == 1); 2302#L257-2 assume !(~C_1_pc~0 == 2); 2303#L267-1 is_C_1_triggered_~__retres1~2 := 0; 2372#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 2312#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 2249#L483 assume !(activate_threads_~tmp___1~1 != 0); 2250#L483-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 2258#L421 assume { :end_inline_reset_delta_events } true; 2379#L537-3 [2018-11-10 03:37:54,568 INFO L795 eck$LassoCheckResult]: Loop: 2379#L537-3 assume true; 2650#L537-1 assume !false; 2635#L538 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 2631#L386 assume true; 2629#L346-1 assume !false; 2627#L347 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 2335#L317 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 2207#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 2288#L335 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 2270#L351 assume !(eval_~tmp___2~0 != 0); 2271#L402 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 2295#L287-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 2296#L413-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 2354#L107-6 assume ~P_1_pc~0 == 1; 2325#L108-2 assume ~P_1_ev~0 == 1;is_P_1_triggered_~__retres1~0 := 1; 2326#L118-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 2330#L119-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 2331#L467-6 assume !(activate_threads_~tmp~1 != 0); 2395#L467-8 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 2396#L175-6 assume !(~P_2_pc~0 == 1); 2397#L175-8 is_P_2_triggered_~__retres1~1 := 0; 2705#L186-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 2703#L187-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 2701#L475-6 assume activate_threads_~tmp___0~1 != 0;~P_2_st~0 := 0; 2699#L475-8 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 2697#L257-6 assume !(~C_1_pc~0 == 1); 2695#L257-8 assume !(~C_1_pc~0 == 2); 2693#L267-5 is_C_1_triggered_~__retres1~2 := 0; 2691#L278-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 2689#L279-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 2688#L483-6 assume activate_threads_~tmp___1~1 != 0;~C_1_st~0 := 0; 2687#L483-8 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 2685#L421-1 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 2677#L317-1 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 2675#L334-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 2673#L335-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 2670#L556 assume !(start_simulation_~tmp~3 == 0); 2667#L556-2 assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 2661#L317-2 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 2659#L334-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 2657#L335-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 2655#L511 assume stop_simulation_~tmp~2 != 0;stop_simulation_~__retres2~0 := 0; 2654#L518 stop_simulation_#res := stop_simulation_~__retres2~0; 2653#L519 start_simulation_#t~ret10 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 2652#L569 assume !(start_simulation_~tmp___0~2 != 0); 2379#L537-3 [2018-11-10 03:37:54,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:37:54,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1307353874, now seen corresponding path program 1 times [2018-11-10 03:37:54,568 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:37:54,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:37:54,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:54,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:37:54,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:54,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:37:54,655 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 03:37:54,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:37:54,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 03:37:54,656 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:37:54,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:37:54,656 INFO L82 PathProgramCache]: Analyzing trace with hash -558541837, now seen corresponding path program 1 times [2018-11-10 03:37:54,656 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:37:54,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:37:54,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:54,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:37:54,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:54,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:37:54,685 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 03:37:54,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:37:54,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 03:37:54,686 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:37:54,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 03:37:54,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 03:37:54,687 INFO L87 Difference]: Start difference. First operand 566 states and 794 transitions. cyclomatic complexity: 229 Second operand 5 states. [2018-11-10 03:37:54,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:37:54,781 INFO L93 Difference]: Finished difference Result 1563 states and 2167 transitions. [2018-11-10 03:37:54,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 03:37:54,782 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1563 states and 2167 transitions. [2018-11-10 03:37:54,788 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1500 [2018-11-10 03:37:54,793 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1563 states to 1563 states and 2167 transitions. [2018-11-10 03:37:54,793 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1563 [2018-11-10 03:37:54,795 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1563 [2018-11-10 03:37:54,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1563 states and 2167 transitions. [2018-11-10 03:37:54,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:37:54,796 INFO L705 BuchiCegarLoop]: Abstraction has 1563 states and 2167 transitions. [2018-11-10 03:37:54,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states and 2167 transitions. [2018-11-10 03:37:54,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 605. [2018-11-10 03:37:54,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2018-11-10 03:37:54,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 833 transitions. [2018-11-10 03:37:54,808 INFO L728 BuchiCegarLoop]: Abstraction has 605 states and 833 transitions. [2018-11-10 03:37:54,808 INFO L608 BuchiCegarLoop]: Abstraction has 605 states and 833 transitions. [2018-11-10 03:37:54,808 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 03:37:54,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 605 states and 833 transitions. [2018-11-10 03:37:54,811 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 572 [2018-11-10 03:37:54,811 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:37:54,811 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:37:54,812 INFO L866 BuchiCegarLoop]: Counterexample stem 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] [2018-11-10 03:37:54,812 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] [2018-11-10 03:37:54,812 INFO L793 eck$LassoCheckResult]: Stem: 4517#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 4365#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 4366#L589 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 4464#L287 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 4465#L294 assume ~P_1_i~0 == 1;~P_1_st~0 := 0; 4530#L294-2 assume ~P_2_i~0 == 1;~P_2_st~0 := 0; 4367#L299-1 assume ~C_1_i~0 == 1;~C_1_st~0 := 0; 4368#L304-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 4430#L413 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 4494#L107 assume !(~P_1_pc~0 == 1); 4482#L107-2 is_P_1_triggered_~__retres1~0 := 0; 4511#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 4535#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 4543#L467 assume !(activate_threads_~tmp~1 != 0); 4544#L467-2 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 4339#L175 assume !(~P_2_pc~0 == 1); 4340#L175-2 is_P_2_triggered_~__retres1~1 := 0; 4341#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 4342#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 4385#L475 assume !(activate_threads_~tmp___0~1 != 0); 4343#L475-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 4344#L257 assume !(~C_1_pc~0 == 1); 4448#L257-2 assume !(~C_1_pc~0 == 2); 4449#L267-1 is_C_1_triggered_~__retres1~2 := 0; 4514#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 4457#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 4393#L483 assume !(activate_threads_~tmp___1~1 != 0); 4394#L483-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 4403#L421 assume { :end_inline_reset_delta_events } true; 4525#L537-3 [2018-11-10 03:37:54,812 INFO L795 eck$LassoCheckResult]: Loop: 4525#L537-3 assume true; 4658#L537-1 assume !false; 4650#L538 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 4647#L386 assume true; 4645#L346-1 assume !false; 4643#L347 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 4635#L317 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 4632#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 4630#L335 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 4619#L351 assume !(eval_~tmp___2~0 != 0); 4620#L402 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 4890#L287-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 4889#L413-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 4888#L107-6 assume !(~P_1_pc~0 == 1); 4886#L107-8 is_P_1_triggered_~__retres1~0 := 0; 4884#L118-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 4882#L119-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 4880#L467-6 assume !(activate_threads_~tmp~1 != 0); 4878#L467-8 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 4876#L175-6 assume !(~P_2_pc~0 == 1); 4874#L175-8 is_P_2_triggered_~__retres1~1 := 0; 4872#L186-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 4870#L187-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 4868#L475-6 assume activate_threads_~tmp___0~1 != 0;~P_2_st~0 := 0; 4867#L475-8 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 4860#L257-6 assume !(~C_1_pc~0 == 1); 4857#L257-8 assume !(~C_1_pc~0 == 2); 4853#L267-5 is_C_1_triggered_~__retres1~2 := 0; 4849#L278-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 4844#L279-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 4840#L483-6 assume activate_threads_~tmp___1~1 != 0;~C_1_st~0 := 0; 4835#L483-8 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 4833#L421-1 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 4784#L317-1 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 4777#L334-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 4720#L335-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 4699#L556 assume !(start_simulation_~tmp~3 == 0); 4692#L556-2 assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 4686#L317-2 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 4684#L334-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 4679#L335-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 4673#L511 assume stop_simulation_~tmp~2 != 0;stop_simulation_~__retres2~0 := 0; 4669#L518 stop_simulation_#res := stop_simulation_~__retres2~0; 4664#L519 start_simulation_#t~ret10 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 4659#L569 assume !(start_simulation_~tmp___0~2 != 0); 4525#L537-3 [2018-11-10 03:37:54,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:37:54,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1966545068, now seen corresponding path program 1 times [2018-11-10 03:37:54,813 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:37:54,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:37:54,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:54,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:37:54,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:54,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:37:54,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:37:54,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:37:54,840 INFO L82 PathProgramCache]: Analyzing trace with hash 360432786, now seen corresponding path program 1 times [2018-11-10 03:37:54,840 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:37:54,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:37:54,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:54,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:37:54,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:54,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:37:54,874 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 03:37:54,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:37:54,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 03:37:54,875 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:37:54,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 03:37:54,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 03:37:54,875 INFO L87 Difference]: Start difference. First operand 605 states and 833 transitions. cyclomatic complexity: 229 Second operand 5 states. [2018-11-10 03:37:54,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:37:54,943 INFO L93 Difference]: Finished difference Result 1067 states and 1457 transitions. [2018-11-10 03:37:54,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 03:37:54,944 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1067 states and 1457 transitions. [2018-11-10 03:37:54,948 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1034 [2018-11-10 03:37:54,950 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1067 states to 1067 states and 1457 transitions. [2018-11-10 03:37:54,950 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1067 [2018-11-10 03:37:54,951 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1067 [2018-11-10 03:37:54,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1067 states and 1457 transitions. [2018-11-10 03:37:54,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:37:54,952 INFO L705 BuchiCegarLoop]: Abstraction has 1067 states and 1457 transitions. [2018-11-10 03:37:54,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states and 1457 transitions. [2018-11-10 03:37:54,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 617. [2018-11-10 03:37:54,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2018-11-10 03:37:54,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 845 transitions. [2018-11-10 03:37:54,960 INFO L728 BuchiCegarLoop]: Abstraction has 617 states and 845 transitions. [2018-11-10 03:37:54,960 INFO L608 BuchiCegarLoop]: Abstraction has 617 states and 845 transitions. [2018-11-10 03:37:54,960 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 03:37:54,961 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 617 states and 845 transitions. [2018-11-10 03:37:54,963 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 584 [2018-11-10 03:37:54,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:37:54,963 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:37:54,964 INFO L866 BuchiCegarLoop]: Counterexample stem 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] [2018-11-10 03:37:54,964 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] [2018-11-10 03:37:54,964 INFO L793 eck$LassoCheckResult]: Stem: 6206#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 6053#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 6054#L589 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 6150#L287 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 6151#L294 assume ~P_1_i~0 == 1;~P_1_st~0 := 0; 6219#L294-2 assume ~P_2_i~0 == 1;~P_2_st~0 := 0; 6055#L299-1 assume ~C_1_i~0 == 1;~C_1_st~0 := 0; 6056#L304-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 6116#L413 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 6183#L107 assume !(~P_1_pc~0 == 1); 6168#L107-2 is_P_1_triggered_~__retres1~0 := 0; 6201#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 6242#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 6233#L467 assume !(activate_threads_~tmp~1 != 0); 6234#L467-2 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 6027#L175 assume !(~P_2_pc~0 == 1); 6028#L175-2 is_P_2_triggered_~__retres1~1 := 0; 6029#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 6030#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 6073#L475 assume !(activate_threads_~tmp___0~1 != 0); 6031#L475-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 6032#L257 assume !(~C_1_pc~0 == 1); 6134#L257-2 assume !(~C_1_pc~0 == 2); 6135#L267-1 is_C_1_triggered_~__retres1~2 := 0; 6204#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 6144#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 6082#L483 assume !(activate_threads_~tmp___1~1 != 0); 6083#L483-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 6091#L421 assume { :end_inline_reset_delta_events } true; 6214#L537-3 [2018-11-10 03:37:54,964 INFO L795 eck$LassoCheckResult]: Loop: 6214#L537-3 assume true; 6438#L537-1 assume !false; 6418#L538 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 6408#L386 assume true; 6356#L346-1 assume !false; 6346#L347 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 6340#L317 assume !(~P_1_st~0 == 0); 6334#L321 assume !(~P_2_st~0 == 0); 6328#L325 assume !(~C_1_st~0 == 0);exists_runnable_thread_~__retres1~3 := 0; 6321#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 6315#L335 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 6313#L351 assume !(eval_~tmp___2~0 != 0); 6312#L402 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 6310#L287-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 6308#L413-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 6307#L107-6 assume ~P_1_pc~0 == 1; 6154#L108-2 assume ~P_1_ev~0 == 1;is_P_1_triggered_~__retres1~0 := 1; 6155#L118-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 6203#L119-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 6605#L467-6 assume !(activate_threads_~tmp~1 != 0); 6228#L467-8 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 6230#L175-6 assume !(~P_2_pc~0 == 1); 6231#L175-8 is_P_2_triggered_~__retres1~1 := 0; 6553#L186-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 6552#L187-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 6044#L475-6 assume activate_threads_~tmp___0~1 != 0;~P_2_st~0 := 0; 6045#L475-8 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 6084#L257-6 assume !(~C_1_pc~0 == 1); 6085#L257-8 assume !(~C_1_pc~0 == 2); 6115#L267-5 is_C_1_triggered_~__retres1~2 := 0; 6177#L278-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 6182#L279-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 6601#L483-6 assume activate_threads_~tmp___1~1 != 0;~C_1_st~0 := 0; 6600#L483-8 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 6599#L421-1 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 6596#L317-1 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 6594#L334-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 6585#L335-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 6580#L556 assume !(start_simulation_~tmp~3 == 0); 6578#L556-2 assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 6575#L317-2 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 6570#L334-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 6530#L335-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 6525#L511 assume stop_simulation_~tmp~2 != 0;stop_simulation_~__retres2~0 := 0; 6522#L518 stop_simulation_#res := stop_simulation_~__retres2~0; 6517#L519 start_simulation_#t~ret10 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 6446#L569 assume !(start_simulation_~tmp___0~2 != 0); 6214#L537-3 [2018-11-10 03:37:54,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:37:54,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1966545068, now seen corresponding path program 2 times [2018-11-10 03:37:54,965 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:37:54,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:37:54,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:54,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:37:54,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:54,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:37:54,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:37:54,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:37:54,979 INFO L82 PathProgramCache]: Analyzing trace with hash 273300762, now seen corresponding path program 1 times [2018-11-10 03:37:54,979 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:37:54,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:37:54,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:54,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:37:54,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:54,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:37:54,999 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 03:37:54,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:37:54,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:37:54,999 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:37:55,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:37:55,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:37:55,000 INFO L87 Difference]: Start difference. First operand 617 states and 845 transitions. cyclomatic complexity: 229 Second operand 3 states. [2018-11-10 03:37:55,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:37:55,030 INFO L93 Difference]: Finished difference Result 1073 states and 1447 transitions. [2018-11-10 03:37:55,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:37:55,031 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1073 states and 1447 transitions. [2018-11-10 03:37:55,036 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1040 [2018-11-10 03:37:55,042 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1073 states to 1073 states and 1447 transitions. [2018-11-10 03:37:55,042 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1073 [2018-11-10 03:37:55,043 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1073 [2018-11-10 03:37:55,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1073 states and 1447 transitions. [2018-11-10 03:37:55,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:37:55,045 INFO L705 BuchiCegarLoop]: Abstraction has 1073 states and 1447 transitions. [2018-11-10 03:37:55,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states and 1447 transitions. [2018-11-10 03:37:55,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 1073. [2018-11-10 03:37:55,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1073 states. [2018-11-10 03:37:55,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 1073 states and 1447 transitions. [2018-11-10 03:37:55,062 INFO L728 BuchiCegarLoop]: Abstraction has 1073 states and 1447 transitions. [2018-11-10 03:37:55,062 INFO L608 BuchiCegarLoop]: Abstraction has 1073 states and 1447 transitions. [2018-11-10 03:37:55,062 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 03:37:55,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1073 states and 1447 transitions. [2018-11-10 03:37:55,066 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1040 [2018-11-10 03:37:55,067 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:37:55,067 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:37:55,067 INFO L866 BuchiCegarLoop]: Counterexample stem 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] [2018-11-10 03:37:55,068 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] [2018-11-10 03:37:55,068 INFO L793 eck$LassoCheckResult]: Stem: 7911#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 7749#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 7750#L589 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 7857#L287 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 7858#L294 assume ~P_1_i~0 == 1;~P_1_st~0 := 0; 7924#L294-2 assume ~P_2_i~0 == 1;~P_2_st~0 := 0; 7751#L299-1 assume ~C_1_i~0 == 1;~C_1_st~0 := 0; 7752#L304-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 7815#L413 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 7889#L107 assume !(~P_1_pc~0 == 1); 7875#L107-2 is_P_1_triggered_~__retres1~0 := 0; 7904#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 7959#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 7949#L467 assume !(activate_threads_~tmp~1 != 0); 7950#L467-2 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 7723#L175 assume !(~P_2_pc~0 == 1); 7724#L175-2 is_P_2_triggered_~__retres1~1 := 0; 7725#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 7726#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 7768#L475 assume !(activate_threads_~tmp___0~1 != 0); 7727#L475-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 7728#L257 assume !(~C_1_pc~0 == 1); 7836#L257-2 assume !(~C_1_pc~0 == 2); 7837#L267-1 is_C_1_triggered_~__retres1~2 := 0; 7909#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 7849#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 7776#L483 assume !(activate_threads_~tmp___1~1 != 0); 7777#L483-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 7786#L421 assume { :end_inline_reset_delta_events } true; 7920#L537-3 [2018-11-10 03:37:55,068 INFO L795 eck$LassoCheckResult]: Loop: 7920#L537-3 assume true; 8098#L537-1 assume !false; 8087#L538 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 8063#L386 assume true; 8057#L346-1 assume !false; 8055#L347 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 8052#L317 assume !(~P_1_st~0 == 0); 8053#L321 assume !(~P_2_st~0 == 0); 8317#L325 assume !(~C_1_st~0 == 0);exists_runnable_thread_~__retres1~3 := 0; 8316#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 8313#L335 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 8311#L351 assume !(eval_~tmp___2~0 != 0); 8305#L402 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 8298#L287-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 8295#L413-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 8294#L107-6 assume ~P_1_pc~0 == 1; 8292#L108-2 assume ~P_1_ev~0 == 1;is_P_1_triggered_~__retres1~0 := 1; 8290#L118-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 8288#L119-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 8286#L467-6 assume activate_threads_~tmp~1 != 0;~P_1_st~0 := 0; 8284#L467-8 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 8282#L175-6 assume !(~P_2_pc~0 == 1); 8280#L175-8 is_P_2_triggered_~__retres1~1 := 0; 8278#L186-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 8276#L187-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 8274#L475-6 assume activate_threads_~tmp___0~1 != 0;~P_2_st~0 := 0; 8272#L475-8 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 8270#L257-6 assume !(~C_1_pc~0 == 1); 8268#L257-8 assume !(~C_1_pc~0 == 2); 8266#L267-5 is_C_1_triggered_~__retres1~2 := 0; 8264#L278-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 8262#L279-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 8260#L483-6 assume activate_threads_~tmp___1~1 != 0;~C_1_st~0 := 0; 8258#L483-8 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 8245#L421-1 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 8241#L317-1 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 8239#L334-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 8238#L335-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 8122#L556 assume !(start_simulation_~tmp~3 == 0); 8118#L556-2 assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 8115#L317-2 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 8113#L334-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 8111#L335-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 8109#L511 assume stop_simulation_~tmp~2 != 0;stop_simulation_~__retres2~0 := 0; 8107#L518 stop_simulation_#res := stop_simulation_~__retres2~0; 8103#L519 start_simulation_#t~ret10 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 8101#L569 assume !(start_simulation_~tmp___0~2 != 0); 7920#L537-3 [2018-11-10 03:37:55,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:37:55,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1966545068, now seen corresponding path program 3 times [2018-11-10 03:37:55,069 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:37:55,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:37:55,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:55,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:37:55,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:55,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:37:55,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:37:55,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:37:55,086 INFO L82 PathProgramCache]: Analyzing trace with hash 782773852, now seen corresponding path program 1 times [2018-11-10 03:37:55,086 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:37:55,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:37:55,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:55,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:37:55,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:55,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:37:55,127 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 03:37:55,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:37:55,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 03:37:55,128 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:37:55,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 03:37:55,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 03:37:55,128 INFO L87 Difference]: Start difference. First operand 1073 states and 1447 transitions. cyclomatic complexity: 375 Second operand 5 states. [2018-11-10 03:37:55,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:37:55,220 INFO L93 Difference]: Finished difference Result 2385 states and 3214 transitions. [2018-11-10 03:37:55,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 03:37:55,221 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2385 states and 3214 transitions. [2018-11-10 03:37:55,232 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2352 [2018-11-10 03:37:55,242 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2385 states to 2385 states and 3214 transitions. [2018-11-10 03:37:55,242 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2385 [2018-11-10 03:37:55,244 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2385 [2018-11-10 03:37:55,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2385 states and 3214 transitions. [2018-11-10 03:37:55,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:37:55,247 INFO L705 BuchiCegarLoop]: Abstraction has 2385 states and 3214 transitions. [2018-11-10 03:37:55,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2385 states and 3214 transitions. [2018-11-10 03:37:55,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2385 to 1109. [2018-11-10 03:37:55,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1109 states. [2018-11-10 03:37:55,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1474 transitions. [2018-11-10 03:37:55,270 INFO L728 BuchiCegarLoop]: Abstraction has 1109 states and 1474 transitions. [2018-11-10 03:37:55,271 INFO L608 BuchiCegarLoop]: Abstraction has 1109 states and 1474 transitions. [2018-11-10 03:37:55,271 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 03:37:55,271 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1109 states and 1474 transitions. [2018-11-10 03:37:55,274 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1076 [2018-11-10 03:37:55,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:37:55,275 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:37:55,275 INFO L866 BuchiCegarLoop]: Counterexample stem 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] [2018-11-10 03:37:55,275 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] [2018-11-10 03:37:55,276 INFO L793 eck$LassoCheckResult]: Stem: 11378#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 11221#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 11222#L589 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 11318#L287 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 11319#L294 assume ~P_1_i~0 == 1;~P_1_st~0 := 0; 11392#L294-2 assume ~P_2_i~0 == 1;~P_2_st~0 := 0; 11223#L299-1 assume ~C_1_i~0 == 1;~C_1_st~0 := 0; 11224#L304-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 11283#L413 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 11352#L107 assume !(~P_1_pc~0 == 1); 11336#L107-2 is_P_1_triggered_~__retres1~0 := 0; 11373#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 11398#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 11412#L467 assume !(activate_threads_~tmp~1 != 0); 11413#L467-2 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 11195#L175 assume !(~P_2_pc~0 == 1); 11196#L175-2 is_P_2_triggered_~__retres1~1 := 0; 11197#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 11198#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 11241#L475 assume !(activate_threads_~tmp___0~1 != 0); 11199#L475-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 11200#L257 assume !(~C_1_pc~0 == 1); 11303#L257-2 assume !(~C_1_pc~0 == 2); 11304#L267-1 is_C_1_triggered_~__retres1~2 := 0; 11376#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 11312#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 11249#L483 assume !(activate_threads_~tmp___1~1 != 0); 11250#L483-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 11258#L421 assume { :end_inline_reset_delta_events } true; 11385#L537-3 [2018-11-10 03:37:55,276 INFO L795 eck$LassoCheckResult]: Loop: 11385#L537-3 assume true; 11764#L537-1 assume !false; 11765#L538 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 11654#L386 assume true; 11655#L346-1 assume !false; 11634#L347 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 11635#L317 assume !(~P_1_st~0 == 0); 11624#L321 assume !(~P_2_st~0 == 0); 11621#L325 assume !(~C_1_st~0 == 0);exists_runnable_thread_~__retres1~3 := 0; 11618#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 11616#L335 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 11613#L351 assume !(eval_~tmp___2~0 != 0); 11610#L402 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 11608#L287-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 11606#L413-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 11604#L107-6 assume ~P_1_pc~0 == 1; 11601#L108-2 assume ~P_1_ev~0 == 1;is_P_1_triggered_~__retres1~0 := 1; 11597#L118-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 11594#L119-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 11584#L467-6 assume activate_threads_~tmp~1 != 0;~P_1_st~0 := 0; 11569#L467-8 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 11568#L175-6 assume !(~P_2_pc~0 == 1); 11567#L175-8 is_P_2_triggered_~__retres1~1 := 0; 11566#L186-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 11565#L187-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 11564#L475-6 assume !(activate_threads_~tmp___0~1 != 0); 11563#L475-8 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 11562#L257-6 assume !(~C_1_pc~0 == 1); 11561#L257-8 assume !(~C_1_pc~0 == 2); 11548#L267-5 is_C_1_triggered_~__retres1~2 := 0; 11549#L278-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 11540#L279-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 11537#L483-6 assume activate_threads_~tmp___1~1 != 0;~C_1_st~0 := 0; 11533#L483-8 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 11534#L421-1 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 11525#L317-1 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 11526#L334-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 11515#L335-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 11516#L556 assume !(start_simulation_~tmp~3 == 0); 11783#L556-2 assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 11779#L317-2 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 11780#L334-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 11775#L335-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 11776#L511 assume stop_simulation_~tmp~2 != 0;stop_simulation_~__retres2~0 := 0; 11771#L518 stop_simulation_#res := stop_simulation_~__retres2~0; 11772#L519 start_simulation_#t~ret10 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 11768#L569 assume !(start_simulation_~tmp___0~2 != 0); 11385#L537-3 [2018-11-10 03:37:55,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:37:55,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1966545068, now seen corresponding path program 4 times [2018-11-10 03:37:55,276 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:37:55,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:37:55,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:55,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:37:55,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:55,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:37:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:37:55,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:37:55,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1001628570, now seen corresponding path program 1 times [2018-11-10 03:37:55,288 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:37:55,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:37:55,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:55,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:37:55,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:37:55,354 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 03:37:55,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:37:55,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 03:37:55,354 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:37:55,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 03:37:55,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 03:37:55,355 INFO L87 Difference]: Start difference. First operand 1109 states and 1474 transitions. cyclomatic complexity: 366 Second operand 5 states. [2018-11-10 03:37:55,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:37:55,452 INFO L93 Difference]: Finished difference Result 2355 states and 3131 transitions. [2018-11-10 03:37:55,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 03:37:55,453 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2355 states and 3131 transitions. [2018-11-10 03:37:55,462 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2322 [2018-11-10 03:37:55,469 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2355 states to 2355 states and 3131 transitions. [2018-11-10 03:37:55,470 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2355 [2018-11-10 03:37:55,471 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2355 [2018-11-10 03:37:55,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2355 states and 3131 transitions. [2018-11-10 03:37:55,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:37:55,474 INFO L705 BuchiCegarLoop]: Abstraction has 2355 states and 3131 transitions. [2018-11-10 03:37:55,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2355 states and 3131 transitions. [2018-11-10 03:37:55,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2355 to 1139. [2018-11-10 03:37:55,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1139 states. [2018-11-10 03:37:55,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1493 transitions. [2018-11-10 03:37:55,494 INFO L728 BuchiCegarLoop]: Abstraction has 1139 states and 1493 transitions. [2018-11-10 03:37:55,494 INFO L608 BuchiCegarLoop]: Abstraction has 1139 states and 1493 transitions. [2018-11-10 03:37:55,494 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 03:37:55,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1139 states and 1493 transitions. [2018-11-10 03:37:55,497 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1106 [2018-11-10 03:37:55,497 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:37:55,498 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:37:55,498 INFO L866 BuchiCegarLoop]: Counterexample stem 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] [2018-11-10 03:37:55,498 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] [2018-11-10 03:37:55,498 INFO L793 eck$LassoCheckResult]: Stem: 14859#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 14700#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 14701#L589 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 14801#L287 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 14802#L294 assume ~P_1_i~0 == 1;~P_1_st~0 := 0; 14870#L294-2 assume ~P_2_i~0 == 1;~P_2_st~0 := 0; 14702#L299-1 assume ~C_1_i~0 == 1;~C_1_st~0 := 0; 14703#L304-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 14765#L413 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 14836#L107 assume !(~P_1_pc~0 == 1); 14820#L107-2 is_P_1_triggered_~__retres1~0 := 0; 14854#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 14906#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 14892#L467 assume !(activate_threads_~tmp~1 != 0); 14893#L467-2 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 14673#L175 assume !(~P_2_pc~0 == 1); 14674#L175-2 is_P_2_triggered_~__retres1~1 := 0; 14675#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 14676#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 14719#L475 assume !(activate_threads_~tmp___0~1 != 0); 14677#L475-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 14678#L257 assume !(~C_1_pc~0 == 1); 14783#L257-2 assume !(~C_1_pc~0 == 2); 14784#L267-1 is_C_1_triggered_~__retres1~2 := 0; 14857#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 14795#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 14727#L483 assume !(activate_threads_~tmp___1~1 != 0); 14728#L483-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 14736#L421 assume { :end_inline_reset_delta_events } true; 14865#L537-3 [2018-11-10 03:37:55,498 INFO L795 eck$LassoCheckResult]: Loop: 14865#L537-3 assume true; 15122#L537-1 assume !false; 15120#L538 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 15074#L386 assume true; 15109#L346-1 assume !false; 15106#L347 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 15101#L317 assume !(~P_1_st~0 == 0); 15102#L321 assume !(~P_2_st~0 == 0); 15683#L325 assume !(~C_1_st~0 == 0);exists_runnable_thread_~__retres1~3 := 0; 15681#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 15680#L335 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 15235#L351 assume !(eval_~tmp___2~0 != 0); 15228#L402 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 15223#L287-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 15218#L413-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 15217#L107-6 assume ~P_1_pc~0 == 1; 15214#L108-2 assume ~P_1_ev~0 == 1;is_P_1_triggered_~__retres1~0 := 1; 15212#L118-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 15210#L119-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 15208#L467-6 assume activate_threads_~tmp~1 != 0;~P_1_st~0 := 0; 15206#L467-8 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 15204#L175-6 assume !(~P_2_pc~0 == 1); 15202#L175-8 is_P_2_triggered_~__retres1~1 := 0; 15200#L186-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 15198#L187-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 15169#L475-6 assume !(activate_threads_~tmp___0~1 != 0); 15159#L475-8 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 15157#L257-6 assume !(~C_1_pc~0 == 1); 15155#L257-8 assume !(~C_1_pc~0 == 2); 15153#L267-5 is_C_1_triggered_~__retres1~2 := 0; 15151#L278-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 15149#L279-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 15147#L483-6 assume !(activate_threads_~tmp___1~1 != 0); 15145#L483-8 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 15143#L421-1 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 15140#L317-1 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 15138#L334-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 15136#L335-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 15133#L556 assume !(start_simulation_~tmp~3 == 0); 15131#L556-2 assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 15129#L317-2 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 15128#L334-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 15127#L335-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 15126#L511 assume stop_simulation_~tmp~2 != 0;stop_simulation_~__retres2~0 := 0; 15125#L518 stop_simulation_#res := stop_simulation_~__retres2~0; 15124#L519 start_simulation_#t~ret10 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 15123#L569 assume !(start_simulation_~tmp___0~2 != 0); 14865#L537-3 [2018-11-10 03:37:55,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:37:55,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1966545068, now seen corresponding path program 5 times [2018-11-10 03:37:55,499 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:37:55,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:37:55,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:55,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:37:55,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:55,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:37:55,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:37:55,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:37:55,516 INFO L82 PathProgramCache]: Analyzing trace with hash -278235108, now seen corresponding path program 1 times [2018-11-10 03:37:55,516 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:37:55,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:37:55,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:55,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:37:55,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:55,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:37:55,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:37:55,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:37:55,528 INFO L82 PathProgramCache]: Analyzing trace with hash 987398161, now seen corresponding path program 1 times [2018-11-10 03:37:55,528 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:37:55,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:37:55,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:55,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:37:55,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:55,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:37:55,565 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 03:37:55,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:37:55,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:37:55,726 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2018-11-10 03:37:55,797 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:37:55,798 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:37:55,800 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:37:55,800 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:37:55,801 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 03:37:55,801 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:37:55,801 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:37:55,801 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:37:55,801 INFO L131 ssoRankerPreferences]: Filename of dumped script: kundu2_false-unreach-call_false-termination.cil.c_Iteration10_Loop [2018-11-10 03:37:55,801 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:37:55,801 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:37:55,823 INFO 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 03:37:55,832 INFO 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 03:37:55,834 INFO 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 03:37:55,836 INFO 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 03:37:55,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:37:55,840 INFO 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 03:37:55,842 INFO 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 03:37:55,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:37:55,846 INFO 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 03:37:55,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:37:55,850 INFO 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 03:37:55,852 INFO 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 03:37:55,854 INFO 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 03:37:55,856 INFO 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 03:37:55,858 INFO 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 03:37:55,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 03:37:55,869 INFO 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 03:37:55,877 INFO 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 03:37:55,879 INFO 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 03:37:55,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:37:55,889 INFO 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 03:37:55,899 INFO 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 03:37:55,900 INFO 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 03:37:55,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:37:55,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:37:55,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:37:55,915 INFO 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 03:37:55,917 INFO 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 03:37:56,121 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:37:56,121 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_270d281e-1610-47b1-941d-32db288cdcd7/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 03:37:56,130 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:37:56,130 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:37:56,144 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:37:56,144 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_exists_runnable_thread_~__retres1~3=1, ULTIMATE.start_stop_simulation_~tmp~2=1, ULTIMATE.start_exists_runnable_thread_#res=1} Honda state: {ULTIMATE.start_exists_runnable_thread_~__retres1~3=1, ULTIMATE.start_stop_simulation_~tmp~2=1, ULTIMATE.start_exists_runnable_thread_#res=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_270d281e-1610-47b1-941d-32db288cdcd7/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:37:56,182 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:37:56,182 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:37:56,205 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:37:56,205 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~ret1=0} Honda state: {ULTIMATE.start_eval_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_270d281e-1610-47b1-941d-32db288cdcd7/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:37:56,249 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:37:56,249 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:37:56,261 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:37:56,261 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_#t~ret10=0} Honda state: {ULTIMATE.start_start_simulation_#t~ret10=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_270d281e-1610-47b1-941d-32db288cdcd7/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 03:37:56,289 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:37:56,290 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:37:56,300 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:37:56,300 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___0~0=0} Honda state: {ULTIMATE.start_eval_~tmp___0~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_270d281e-1610-47b1-941d-32db288cdcd7/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 03:37:56,328 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:37:56,328 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:37:56,331 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:37:56,331 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_#t~ret9=0} Honda state: {ULTIMATE.start_start_simulation_#t~ret9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_270d281e-1610-47b1-941d-32db288cdcd7/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 03:37:56,358 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:37:56,359 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:37:56,363 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:37:56,363 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_#t~ret5=0} Honda state: {ULTIMATE.start_activate_threads_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_270d281e-1610-47b1-941d-32db288cdcd7/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 03:37:56,391 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:37:56,391 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:37:56,405 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:37:56,405 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~P_2_pc~0=-2} Honda state: {~P_2_pc~0=-2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_270d281e-1610-47b1-941d-32db288cdcd7/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 03:37:56,435 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:37:56,435 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:37:56,437 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:37:56,438 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___1~0=0} Honda state: {ULTIMATE.start_eval_~tmp___1~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_270d281e-1610-47b1-941d-32db288cdcd7/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 03:37:56,465 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:37:56,466 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:37:56,469 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:37:56,469 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stop_simulation_#t~ret8=0} Honda state: {ULTIMATE.start_stop_simulation_#t~ret8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_270d281e-1610-47b1-941d-32db288cdcd7/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 03:37:56,498 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:37:56,498 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:37:56,512 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:37:56,512 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet4=0} Honda state: {ULTIMATE.start_eval_#t~nondet4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_270d281e-1610-47b1-941d-32db288cdcd7/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 03:37:56,540 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:37:56,540 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:37:56,542 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:37:56,542 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_#t~ret7=0} Honda state: {ULTIMATE.start_activate_threads_#t~ret7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_270d281e-1610-47b1-941d-32db288cdcd7/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 03:37:56,570 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:37:56,570 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:37:56,573 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:37:56,573 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet2=0} Honda state: {ULTIMATE.start_eval_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_270d281e-1610-47b1-941d-32db288cdcd7/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 03:37:56,601 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:37:56,602 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:37:56,606 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:37:56,606 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~P_2_st~0=7} Honda state: {~P_2_st~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_270d281e-1610-47b1-941d-32db288cdcd7/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 03:37:56,641 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:37:56,641 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:37:56,644 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:37:56,644 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet3=0} Honda state: {ULTIMATE.start_eval_#t~nondet3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_270d281e-1610-47b1-941d-32db288cdcd7/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 03:37:56,674 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:37:56,674 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:37:56,693 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:37:56,693 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_~tmp___0~1=0, ULTIMATE.start_is_P_2_triggered_~__retres1~1=0, ULTIMATE.start_is_P_2_triggered_#res=0} Honda state: {ULTIMATE.start_activate_threads_~tmp___0~1=0, ULTIMATE.start_is_P_2_triggered_~__retres1~1=0, ULTIMATE.start_is_P_2_triggered_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_270d281e-1610-47b1-941d-32db288cdcd7/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 03:37:56,720 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:37:56,720 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_270d281e-1610-47b1-941d-32db288cdcd7/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 03:37:56,750 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 03:37:56,750 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:37:56,783 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 03:37:56,784 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:37:56,784 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:37:56,785 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:37:56,785 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:37:56,785 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:37:56,785 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:37:56,785 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:37:56,785 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:37:56,785 INFO L131 ssoRankerPreferences]: Filename of dumped script: kundu2_false-unreach-call_false-termination.cil.c_Iteration10_Loop [2018-11-10 03:37:56,785 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:37:56,785 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:37:56,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:37:56,793 INFO 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 03:37:56,799 INFO 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 03:37:56,826 INFO 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 03:37:56,828 INFO 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 03:37:56,829 INFO 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 03:37:56,832 INFO 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 03:37:56,840 INFO 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 03:37:56,842 INFO 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 03:37:56,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:37:56,846 INFO 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 03:37:56,847 INFO 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 03:37:56,849 INFO 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 03:37:56,856 INFO 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 03:37:56,860 INFO 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 03:37:56,863 INFO 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 03:37:56,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:37:56,874 INFO 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 03:37:56,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 03:37:56,879 INFO 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 03:37:56,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:37:56,890 INFO 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 03:37:56,893 INFO 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 03:37:56,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:37:56,925 INFO 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 03:37:56,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:37:56,934 INFO 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 03:37:56,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:37:57,168 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:37:57,172 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:37:57,174 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:57,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,175 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:37:57,178 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:37:57,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,180 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:37:57,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:37:57,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,185 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,186 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:37:57,187 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:37:57,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,189 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,189 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,189 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:37:57,190 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:37:57,190 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,191 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,192 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:37:57,193 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:37:57,193 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,193 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,194 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:57,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,194 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:37:57,195 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:37:57,195 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,196 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,196 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,196 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:37:57,197 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:37:57,197 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,198 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,198 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,199 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,199 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:37:57,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:37:57,200 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:57,200 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,201 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,202 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:37:57,202 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:37:57,202 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,203 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:57,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:37:57,204 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:37:57,205 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,205 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,206 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,206 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:37:57,207 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:37:57,207 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,208 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,208 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:37:57,209 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:37:57,209 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,210 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,210 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,211 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:37:57,211 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:37:57,212 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,212 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:37:57,214 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:37:57,214 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,215 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:57,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,216 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,216 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:37:57,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:37:57,216 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:57,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,217 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,218 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,218 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:37:57,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:37:57,219 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:57,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,221 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,222 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:37:57,223 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:37:57,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,225 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,225 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:37:57,226 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:37:57,226 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,227 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,227 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,228 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:37:57,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:37:57,229 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:57,229 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,229 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,230 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:57,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,230 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,230 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:37:57,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:37:57,231 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:57,231 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,232 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,232 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:57,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,233 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,233 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:37:57,234 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:37:57,234 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,235 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:57,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,235 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:37:57,236 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:37:57,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,237 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,238 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,238 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,238 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:37:57,239 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:37:57,239 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,239 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:57,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,240 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:37:57,241 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:37:57,241 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,242 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,243 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:57,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,243 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:37:57,244 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:37:57,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,246 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:37:57,248 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:37:57,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,249 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,250 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:57,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,250 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,251 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:37:57,251 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:37:57,251 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,252 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,253 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:57,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,253 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:37:57,254 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:37:57,254 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,255 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,255 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 03:37:57,255 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,256 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,256 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,257 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:37:57,257 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,258 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:57,258 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,258 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,259 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,259 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:37:57,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,262 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,263 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,263 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,264 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,264 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:37:57,265 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,266 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,267 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,267 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,267 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:37:57,267 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,268 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,268 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,269 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,270 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:37:57,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,270 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,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 03:37:57,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,271 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,272 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:37:57,272 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,273 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:57,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,274 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,274 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:37:57,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,275 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,275 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,276 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:37:57,276 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,277 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:37:57,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,278 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,278 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:57,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,278 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,279 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,279 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:37:57,279 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,280 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,281 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,281 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:37:57,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,282 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,282 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:57,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,283 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,283 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,284 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:37:57,284 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,284 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:57,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,285 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,285 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,286 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:37:57,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,287 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,288 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:57,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,289 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,289 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:37:57,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,290 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,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 03:37:57,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,291 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,292 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:37:57,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,293 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,294 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:37:57,294 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,294 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:37:57,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,295 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,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 03:37:57,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,296 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,296 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:37:57,296 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,297 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:37:57,297 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,300 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:57,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,301 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,301 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:37:57,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,303 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,303 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:57,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,303 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,304 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,304 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:37:57,304 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,305 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,306 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,306 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:37:57,306 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,307 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:37:57,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,307 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,308 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:37:57,309 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,309 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:37:57,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,310 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,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 03:37:57,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,311 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,311 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,312 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:37:57,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,313 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,314 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,314 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,314 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:37:57,315 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,316 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,316 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:57,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,317 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,317 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:37:57,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,318 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,319 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,341 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,341 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:37:57,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,343 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,347 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,347 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:37:57,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,350 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,350 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,351 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,351 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,351 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,351 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,351 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,351 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:37:57,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,357 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,357 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,358 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,358 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,358 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:37:57,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,360 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,365 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:57,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,365 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,365 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,366 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:37:57,366 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,366 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,366 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 03:37:57,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 03:37:57,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,367 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:57,368 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:57,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,368 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,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 03:37:57,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,369 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,369 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:57,370 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:57,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,373 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,373 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,373 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,374 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:57,374 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:57,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,375 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,376 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:57,377 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:57,377 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,377 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,378 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:57,378 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:57,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,379 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,380 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,380 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:57,381 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:57,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,381 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,382 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:57,382 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:57,382 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,383 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,383 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,384 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:37:57,384 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:57,384 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 03:37:57,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,385 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,386 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:57,386 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:57,386 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,387 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,387 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,388 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,388 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:57,388 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:57,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,389 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,389 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:57,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,390 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:57,390 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:57,391 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,391 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,392 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:57,392 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:57,392 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,393 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,394 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:57,394 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:57,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,395 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:57,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,396 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:57,396 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:57,396 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,397 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,398 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:37:57,398 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:57,398 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 03:37:57,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,399 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,400 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,400 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:37:57,400 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:57,401 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 03:37:57,401 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,404 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,404 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,405 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:57,405 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:57,405 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,406 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,407 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,407 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,407 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:57,408 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:57,408 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,408 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,412 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,413 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,413 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:37:57,413 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:57,413 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 03:37:57,414 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,415 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:57,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,415 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,416 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:37:57,416 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:57,416 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 03:37:57,416 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,417 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,421 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,421 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:57,422 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:57,422 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,423 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,423 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:57,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,423 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,424 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:57,424 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:57,424 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,426 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,426 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,426 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,426 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:57,427 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:57,427 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,427 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,427 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,427 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,428 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:57,428 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:57,428 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,429 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,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 03:37:57,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,430 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,430 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:57,431 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:57,431 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,434 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,434 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:57,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,435 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:57,436 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:57,436 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,437 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,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 03:37:57,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,438 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,439 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:57,439 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:57,439 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,441 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,441 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,441 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,441 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,442 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,442 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:57,442 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:57,442 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,443 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,443 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 03:37:57,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 03:37:57,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,443 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,444 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:57,444 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:37:57,444 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,445 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,445 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,446 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:57,446 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:37:57,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,450 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,450 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:57,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,451 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,451 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:57,452 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:37:57,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,453 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,453 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,454 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,454 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:57,454 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:37:57,454 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,455 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,455 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,456 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:57,456 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:37:57,456 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,457 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,458 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,458 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:57,459 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:37:57,459 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,459 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,460 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,460 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,460 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:57,461 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:37:57,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,461 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:57,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,462 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:37:57,463 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:57,463 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 03:37:57,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,464 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,465 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:57,465 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:37:57,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,466 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,466 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:57,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,467 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:57,467 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:37:57,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,468 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,468 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:57,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,477 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:57,478 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:37:57,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,479 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,479 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:57,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,480 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:57,480 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:37:57,480 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,481 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,481 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,482 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:57,482 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:37:57,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,483 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,484 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:57,484 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:37:57,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,498 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,499 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,499 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,499 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:37:57,499 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:57,500 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 03:37:57,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,501 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,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 03:37:57,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,502 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:37:57,502 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:57,502 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 03:37:57,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,506 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,506 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,507 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:57,507 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:37:57,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,512 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,519 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:57,519 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:37:57,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,520 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:57,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,521 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:37:57,521 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:57,521 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 03:37:57,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,522 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,523 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:37:57,523 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:57,523 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 03:37:57,524 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,527 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,527 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,528 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,540 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:57,541 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:37:57,541 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,542 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,542 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,543 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:57,543 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:37:57,543 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,547 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,548 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:57,548 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:37:57,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,549 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,549 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,550 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:57,550 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:37:57,550 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,564 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,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 03:37:57,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,565 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:57,566 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:37:57,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,570 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,571 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:57,571 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:37:57,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,573 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,574 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,574 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:57,575 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:37:57,575 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,576 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:37:57,583 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,583 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:57,583 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:37:57,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,584 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,584 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 03:37:57,585 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,585 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:57,585 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:57,585 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,586 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,586 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:37:57,586 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,587 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,587 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,588 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:57,588 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:57,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,588 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,589 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:37:57,589 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,598 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,598 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:57,608 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:57,608 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:57,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,609 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,609 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:37:57,609 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,610 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,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 03:37:57,611 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:57,611 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:57,611 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,611 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,611 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,612 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:37:57,612 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,613 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,613 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:57,613 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:57,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,614 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,614 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:37:57,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,615 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,631 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:57,631 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:57,631 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,631 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,632 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:37:57,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,633 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:57,633 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:57,633 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:57,633 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,634 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,634 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:37:57,634 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,635 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,635 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:57,636 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:57,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,636 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:37:57,636 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,637 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:37:57,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,641 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:57,652 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:57,652 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:57,652 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,653 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,653 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:37:57,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,654 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:57,654 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:57,654 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:57,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,655 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,655 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:37:57,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,656 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,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 03:37:57,657 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:57,657 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:57,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,657 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,657 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:37:57,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,658 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,658 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,676 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:57,676 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:57,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,676 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,677 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:37:57,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,678 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,678 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:57,678 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:57,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,679 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,679 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:37:57,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,680 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,681 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,681 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:57,681 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:57,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,682 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,682 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:37:57,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,683 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,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 03:37:57,700 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:57,700 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:57,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,700 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:37:57,700 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,701 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:37:57,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,706 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,707 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,707 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:57,707 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:57,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,708 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:37:57,708 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,709 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:37:57,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,718 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,719 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:57,719 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:57,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,719 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,720 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:37:57,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,723 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:57,723 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:57,724 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:57,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,724 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,724 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:37:57,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,725 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,726 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:57,726 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:57,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,726 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:37:57,726 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,727 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:37:57,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,730 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:57,731 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:57,731 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:57,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,731 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:37:57,731 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,732 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:37:57,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,735 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:57,748 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:57,749 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:57,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,749 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,749 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:37:57,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,751 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,751 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:57,751 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:57,752 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,752 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,752 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:37:57,752 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,754 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:57,755 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:57,755 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:57,755 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,755 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,756 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:37:57,756 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,757 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,757 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:57,771 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:57,772 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:57,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,772 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,772 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:37:57,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,775 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,775 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:57,775 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:57,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,776 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,777 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:37:57,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,782 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:57,782 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:57,782 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:57,783 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,783 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,783 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:37:57,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,786 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:57,795 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:57,796 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:57,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,796 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,796 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:37:57,797 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,799 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,799 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:57,800 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:57,800 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:57,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,800 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:37:57,800 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:37:57,800 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,801 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,801 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 03:37:57,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 03:37:57,802 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:57,802 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:37:57,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,802 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:57,803 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:57,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,805 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,822 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:57,823 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:37:57,823 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,823 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:57,824 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:57,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,839 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,839 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,839 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:57,839 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:37:57,840 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,840 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:57,841 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:57,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,846 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:57,847 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:57,847 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:37:57,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,847 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:57,848 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:57,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,849 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,849 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:57,851 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:57,851 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:37:57,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,851 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:57,852 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:57,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,853 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,854 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:57,854 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:37:57,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,855 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:57,855 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:57,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,858 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,859 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:57,859 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:37:57,859 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,859 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:57,860 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:57,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,861 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,875 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:57,875 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:37:57,875 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,875 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:37:57,875 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:57,876 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 03:37:57,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,879 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,879 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,880 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:57,880 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:37:57,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,881 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:57,882 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:57,882 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,883 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,883 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:57,884 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:57,884 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:37:57,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,884 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:57,885 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:57,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,886 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,902 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:57,903 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:37:57,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,903 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:57,903 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:57,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,905 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,905 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:57,905 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:57,905 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:37:57,905 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,906 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:57,906 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:57,906 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,907 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,908 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,908 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:57,909 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:37:57,909 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,909 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:57,910 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:57,910 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,911 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,911 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,928 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:57,928 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:37:57,928 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,928 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:57,929 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:57,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,930 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,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 03:37:57,931 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:57,931 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:37:57,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,931 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:37:57,931 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:57,932 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 03:37:57,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,944 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,945 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:57,945 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:37:57,945 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,945 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:37:57,945 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:57,946 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 03:37:57,946 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,956 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,956 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:57,967 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:57,967 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:37:57,967 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,968 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:57,968 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:57,969 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,971 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,971 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,971 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:57,971 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:37:57,971 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,972 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:57,972 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:57,972 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,973 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,974 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:57,974 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:57,974 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:37:57,974 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,974 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:37:57,975 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:57,975 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 03:37:57,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,988 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,988 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:57,988 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:57,988 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:37:57,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,989 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:37:57,989 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:57,990 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 03:37:57,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,994 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,995 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:57,995 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:57,995 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:37:57,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:57,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:57,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:57,996 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:57,997 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:57,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:57,999 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:57,999 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:57,999 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:57,999 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:37:58,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,000 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:58,002 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:58,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,005 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:58,006 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,006 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:37:58,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,006 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:58,007 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:58,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,008 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:58,009 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,009 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:37:58,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,010 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:58,010 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:58,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,017 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:58,018 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,018 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:37:58,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,019 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:58,020 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:58,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,026 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:58,034 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,034 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:37:58,034 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,034 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:58,035 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:58,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,038 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,039 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:58,039 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,039 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:37:58,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,040 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:58,040 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:58,040 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,043 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,044 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:58,044 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,045 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:37:58,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,045 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:58,046 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:58,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,047 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,047 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 03:37:58,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 03:37:58,062 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,062 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,062 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,063 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:58,063 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:37:58,063 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,064 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:58,065 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,065 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,065 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,065 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:58,067 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:37:58,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,090 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,090 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:58,091 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,091 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,091 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,091 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:58,093 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:37:58,093 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,094 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:58,095 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,095 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,095 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,095 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:58,097 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:37:58,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,098 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,098 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:58,098 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,098 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,098 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,099 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:58,099 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:37:58,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,102 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:58,102 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,103 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,103 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,103 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:58,104 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:37:58,104 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,105 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:58,116 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,116 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,117 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:58,117 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:37:58,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,118 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,119 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:58,119 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,119 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,119 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:37:58,119 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:58,121 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 03:37:58,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,127 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:58,127 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,127 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,128 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:58,129 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:37:58,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,130 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:58,142 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,142 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,143 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,143 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:58,144 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:37:58,144 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,145 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,145 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:58,145 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,145 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,146 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:58,146 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:37:58,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,147 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:58,148 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,148 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,148 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:58,149 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:37:58,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,150 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,150 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:58,170 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,170 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,170 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,171 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:58,171 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:37:58,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,172 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:58,173 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,173 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,174 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:58,174 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:37:58,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,175 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:58,176 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,176 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,176 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:37:58,176 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:58,178 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 03:37:58,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,184 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:58,198 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,199 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,199 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,199 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:37:58,199 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:58,201 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 03:37:58,201 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,209 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:58,210 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,210 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,210 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,210 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:58,212 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:37:58,212 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,214 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:58,215 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,215 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,215 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,215 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:58,216 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:37:58,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,217 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:58,230 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,230 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,230 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,230 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:37:58,231 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:58,232 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 03:37:58,232 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,238 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,238 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:58,239 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,239 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,239 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,239 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:37:58,239 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:58,241 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 03:37:58,241 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,246 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:58,247 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,247 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,248 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:58,250 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:37:58,250 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,251 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,251 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:58,259 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,259 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,259 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,259 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:58,260 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:37:58,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,263 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,264 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:58,273 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,274 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,274 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,274 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:58,275 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:37:58,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,276 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,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 03:37:58,276 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,276 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,277 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:58,277 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:37:58,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,282 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,282 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:58,288 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,288 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,289 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:58,290 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:37:58,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,300 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,303 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:58,303 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,304 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,304 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,304 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:58,305 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:37:58,305 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,309 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,309 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:58,309 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,310 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,310 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,310 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:58,311 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:37:58,311 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,315 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,316 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:58,320 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,320 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,320 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,321 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:37:58,321 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:37:58,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,322 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,323 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 03:37:58,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:58,323 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,323 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:58,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,324 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:58,328 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:58,329 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,330 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,330 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:58,331 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,331 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:58,331 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,331 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:58,332 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:58,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,340 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,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 03:37:58,352 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,352 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:58,353 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,353 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:58,353 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:58,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,356 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,357 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:58,357 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,357 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:58,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,357 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:58,358 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:58,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,359 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,359 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:58,360 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,360 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:58,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,360 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:58,360 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:58,360 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,362 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,362 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:58,380 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,380 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:58,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,381 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:58,381 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:58,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,382 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,383 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:58,383 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,383 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:58,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,383 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:58,384 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:58,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,385 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:58,386 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,386 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:58,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,386 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:37:58,386 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:58,387 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 03:37:58,387 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,390 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:58,411 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,411 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:58,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,411 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:58,412 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:58,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,413 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:58,414 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,414 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:58,414 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,414 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:58,415 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:58,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,417 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,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 03:37:58,417 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,417 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:58,417 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,418 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:58,418 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:58,418 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,419 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:58,442 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,442 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:58,442 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,442 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,442 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:58,443 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:58,443 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,444 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,444 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:58,445 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,445 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:58,445 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,445 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:58,445 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:58,445 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,447 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,447 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:58,447 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,447 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:58,447 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,448 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:58,454 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:58,454 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,455 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,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 03:37:58,470 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,470 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:58,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,471 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:37:58,471 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:58,471 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 03:37:58,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,473 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,474 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:58,474 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,474 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:58,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,474 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:37:58,474 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:58,475 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 03:37:58,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,484 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,485 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:58,485 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,485 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:58,485 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,486 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:58,486 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:58,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,491 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:58,502 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,502 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:58,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,502 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:58,503 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:58,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,504 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:58,505 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,505 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:58,505 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,505 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:37:58,505 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:58,506 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 03:37:58,506 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,508 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,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 03:37:58,509 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,509 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:58,509 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,509 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:37:58,509 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:58,510 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 03:37:58,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,512 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:58,535 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,535 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:58,535 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,535 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:58,536 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:58,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,539 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,539 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:58,540 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,540 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:58,540 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,542 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:58,543 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:58,543 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,544 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:58,545 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,545 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:58,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,546 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:58,546 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:58,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,547 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:58,570 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,570 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:58,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,570 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:58,570 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:58,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,572 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:58,573 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,573 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:58,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,573 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:58,574 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:58,574 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,581 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:58,581 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,581 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:58,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,582 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:58,582 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:58,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,585 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,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 03:37:58,600 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,600 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:58,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,600 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:58,600 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:58,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,603 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,603 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:58,603 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,604 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:37:58,604 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,606 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:37:58,607 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:37:58,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,608 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,608 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 03:37:58,609 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:58,609 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,609 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,609 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,609 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:37:58,610 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:37:58,610 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,612 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,612 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:58,635 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,635 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,635 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,635 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:37:58,636 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:37:58,636 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,655 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,655 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:58,656 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,656 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,656 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,659 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:37:58,660 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:37:58,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,665 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:58,666 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,666 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,666 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:37:58,667 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:37:58,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,670 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:58,671 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,671 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,671 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:37:58,671 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:37:58,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,674 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,674 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:58,674 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,674 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,675 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:37:58,675 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:37:58,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,678 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:58,679 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,679 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,679 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,679 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:37:58,680 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:37:58,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,682 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:58,702 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,702 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,702 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:37:58,702 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:37:58,703 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 03:37:58,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,706 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:58,707 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,707 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,707 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,707 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:37:58,708 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:37:58,708 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,711 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:58,711 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,711 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,712 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:37:58,713 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:37:58,713 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,715 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:58,735 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,736 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,736 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:37:58,737 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:37:58,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,739 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:58,740 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,740 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,741 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:37:58,742 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:37:58,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,744 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:58,745 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,745 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,746 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:37:58,746 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:37:58,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,748 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:58,771 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,771 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,772 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:37:58,772 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:37:58,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,775 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:58,775 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,776 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,776 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:37:58,777 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:37:58,778 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 03:37:58,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,782 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:58,783 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,783 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,783 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,783 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:37:58,784 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:37:58,785 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 03:37:58,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,794 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,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 03:37:58,806 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,806 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,806 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,807 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:37:58,808 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:37:58,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,814 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:58,814 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,815 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,815 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:37:58,816 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:37:58,816 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,819 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:58,820 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,820 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,820 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:37:58,820 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:37:58,821 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 03:37:58,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,825 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,825 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:58,839 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,840 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,840 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,840 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:37:58,840 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:37:58,841 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 03:37:58,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,845 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,845 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:58,846 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,846 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,847 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:37:58,848 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:37:58,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,853 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:58,854 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,854 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,855 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:37:58,855 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:37:58,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,858 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:58,876 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,877 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,877 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:37:58,878 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:37:58,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,881 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,881 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:58,881 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,881 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,882 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:37:58,882 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:37:58,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,886 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 03:37:58,887 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,887 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,887 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:37:58,889 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:37:58,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,902 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:58,915 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,915 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,915 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,915 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:37:58,916 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:37:58,916 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,921 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,922 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:58,922 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,922 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,923 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:37:58,923 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:37:58,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,930 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:37:58,931 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:37:58,931 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:37:58,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:37:58,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:37:58,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:37:58,932 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:37:58,935 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:37:58,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:37:58,938 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:37:58,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:37:58,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:37:58,949 INFO L87 Difference]: Start difference. First operand 1139 states and 1493 transitions. cyclomatic complexity: 355 Second operand 3 states. [2018-11-10 03:37:59,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:37:59,215 INFO L93 Difference]: Finished difference Result 1139 states and 1477 transitions. [2018-11-10 03:37:59,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:37:59,215 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1139 states and 1477 transitions. [2018-11-10 03:37:59,222 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1106 [2018-11-10 03:37:59,226 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1139 states to 1139 states and 1477 transitions. [2018-11-10 03:37:59,226 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1139 [2018-11-10 03:37:59,227 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1139 [2018-11-10 03:37:59,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1139 states and 1477 transitions. [2018-11-10 03:37:59,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:37:59,228 INFO L705 BuchiCegarLoop]: Abstraction has 1139 states and 1477 transitions. [2018-11-10 03:37:59,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states and 1477 transitions. [2018-11-10 03:37:59,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1139. [2018-11-10 03:37:59,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1139 states. [2018-11-10 03:37:59,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1477 transitions. [2018-11-10 03:37:59,249 INFO L728 BuchiCegarLoop]: Abstraction has 1139 states and 1477 transitions. [2018-11-10 03:37:59,249 INFO L608 BuchiCegarLoop]: Abstraction has 1139 states and 1477 transitions. [2018-11-10 03:37:59,249 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 03:37:59,249 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1139 states and 1477 transitions. [2018-11-10 03:37:59,253 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1106 [2018-11-10 03:37:59,254 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:37:59,254 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:37:59,255 INFO L866 BuchiCegarLoop]: Counterexample stem 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] [2018-11-10 03:37:59,255 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, 1, 1, 1, 1, 1, 1] [2018-11-10 03:37:59,255 INFO L793 eck$LassoCheckResult]: Stem: 17146#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 16985#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 16986#L589 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 17087#L287 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 17088#L294 assume ~P_1_i~0 == 1;~P_1_st~0 := 0; 17157#L294-2 assume ~P_2_i~0 == 1;~P_2_st~0 := 0; 16989#L299-1 assume ~C_1_i~0 == 1;~C_1_st~0 := 0; 16990#L304-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 17051#L413 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 17123#L107 assume !(~P_1_pc~0 == 1); 17106#L107-2 is_P_1_triggered_~__retres1~0 := 0; 17139#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 17185#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 17178#L467 assume !(activate_threads_~tmp~1 != 0); 17179#L467-2 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 16959#L175 assume !(~P_2_pc~0 == 1); 16960#L175-2 is_P_2_triggered_~__retres1~1 := 0; 16961#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 16962#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 17007#L475 assume !(activate_threads_~tmp___0~1 != 0); 16963#L475-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 16964#L257 assume !(~C_1_pc~0 == 1); 17071#L257-2 assume !(~C_1_pc~0 == 2); 17072#L267-1 is_C_1_triggered_~__retres1~2 := 0; 17143#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 17081#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 17012#L483 assume !(activate_threads_~tmp___1~1 != 0); 17013#L483-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 17021#L421 assume { :end_inline_reset_delta_events } true; 17155#L537-3 [2018-11-10 03:37:59,255 INFO L795 eck$LassoCheckResult]: Loop: 17155#L537-3 assume true; 18050#L537-1 assume !false; 18048#L538 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 17829#L386 assume true; 18047#L346-1 assume !false; 18046#L347 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 17898#L317 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 17054#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 17055#L335 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 17031#L351 assume eval_~tmp___2~0 != 0; 17032#L351-1 assume ~P_1_st~0 == 0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 17163#L360 assume eval_~tmp~0 != 0;~P_1_st~0 := 1;assume { :begin_inline_P_1 } true; 17085#L72 assume ~P_1_pc~0 == 0; 17000#L76 assume true; 17001#L83 assume !(~i~0 < ~max_loop~0); 17033#L95 ~P_1_st~0 := 2; 17034#L99 assume { :end_inline_P_1 } true; 16994#L356 assume !(~P_2_st~0 == 0); 17053#L371 assume !(~C_1_st~0 == 0); 17846#L386 assume true; 17844#L346-1 assume !false; 17842#L347 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 17841#L317 assume !(~P_1_st~0 == 0); 17840#L321 assume !(~P_2_st~0 == 0); 17838#L325 assume !(~C_1_st~0 == 0);exists_runnable_thread_~__retres1~3 := 0; 17839#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 17834#L335 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 17835#L351 assume !(eval_~tmp___2~0 != 0); 17124#L402 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 17064#L287-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 17065#L413-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 17126#L107-6 assume ~P_1_pc~0 == 1; 17092#L108-2 assume ~P_1_ev~0 == 1;is_P_1_triggered_~__retres1~0 := 1; 17093#L118-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 17907#L119-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 17903#L467-6 assume activate_threads_~tmp~1 != 0;~P_1_st~0 := 0; 17173#L467-8 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 17174#L175-6 assume !(~P_2_pc~0 == 1); 17172#L175-8 is_P_2_triggered_~__retres1~1 := 0; 17005#L186-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 17006#L187-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 16976#L475-6 assume !(activate_threads_~tmp___0~1 != 0); 16977#L475-8 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 17177#L257-6 assume !(~C_1_pc~0 == 1); 17942#L257-8 assume !(~C_1_pc~0 == 2); 17937#L267-5 is_C_1_triggered_~__retres1~2 := 0; 17933#L278-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 17931#L279-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 17929#L483-6 assume !(activate_threads_~tmp___1~1 != 0); 17927#L483-8 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 17924#L421-1 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 17922#L317-1 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 17920#L334-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 17918#L335-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 17915#L556 assume !(start_simulation_~tmp~3 == 0); 17138#L556-2 assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 17112#L317-2 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 17059#L334-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 17060#L335-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 16981#L511 assume stop_simulation_~tmp~2 != 0;stop_simulation_~__retres2~0 := 0; 16982#L518 stop_simulation_#res := stop_simulation_~__retres2~0; 16998#L519 start_simulation_#t~ret10 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 16999#L569 assume !(start_simulation_~tmp___0~2 != 0); 17155#L537-3 [2018-11-10 03:37:59,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:37:59,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1966545068, now seen corresponding path program 6 times [2018-11-10 03:37:59,256 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:37:59,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:37:59,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:59,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:37:59,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:59,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:37:59,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:37:59,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:37:59,267 INFO L82 PathProgramCache]: Analyzing trace with hash 194105802, now seen corresponding path program 1 times [2018-11-10 03:37:59,267 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:37:59,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:37:59,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:59,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:37:59,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:59,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:37:59,435 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:37:59,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:37:59,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:37:59,436 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:37:59,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:37:59,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:37:59,436 INFO L87 Difference]: Start difference. First operand 1139 states and 1477 transitions. cyclomatic complexity: 339 Second operand 3 states. [2018-11-10 03:37:59,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:37:59,557 INFO L93 Difference]: Finished difference Result 1908 states and 2457 transitions. [2018-11-10 03:37:59,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:37:59,559 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1908 states and 2457 transitions. [2018-11-10 03:37:59,565 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1864 [2018-11-10 03:37:59,569 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1908 states to 1908 states and 2457 transitions. [2018-11-10 03:37:59,569 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1908 [2018-11-10 03:37:59,570 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1908 [2018-11-10 03:37:59,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1908 states and 2457 transitions. [2018-11-10 03:37:59,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:37:59,572 INFO L705 BuchiCegarLoop]: Abstraction has 1908 states and 2457 transitions. [2018-11-10 03:37:59,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1908 states and 2457 transitions. [2018-11-10 03:37:59,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1908 to 1892. [2018-11-10 03:37:59,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1892 states. [2018-11-10 03:37:59,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1892 states and 2437 transitions. [2018-11-10 03:37:59,589 INFO L728 BuchiCegarLoop]: Abstraction has 1892 states and 2437 transitions. [2018-11-10 03:37:59,589 INFO L608 BuchiCegarLoop]: Abstraction has 1892 states and 2437 transitions. [2018-11-10 03:37:59,589 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-10 03:37:59,589 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1892 states and 2437 transitions. [2018-11-10 03:37:59,594 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1848 [2018-11-10 03:37:59,594 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:37:59,594 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:37:59,594 INFO L866 BuchiCegarLoop]: Counterexample stem 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] [2018-11-10 03:37:59,594 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:37:59,595 INFO L793 eck$LassoCheckResult]: Stem: 20191#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 20038#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 20039#L589 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 20132#L287 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 20133#L294 assume ~P_1_i~0 == 1;~P_1_st~0 := 0; 20204#L294-2 assume ~P_2_i~0 == 1;~P_2_st~0 := 0; 20040#L299-1 assume ~C_1_i~0 == 1;~C_1_st~0 := 0; 20041#L304-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 20098#L413 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 20164#L107 assume !(~P_1_pc~0 == 1); 20184#L107-2 is_P_1_triggered_~__retres1~0 := 0; 20185#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 20151#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 20152#L467 assume !(activate_threads_~tmp~1 != 0); 20228#L467-2 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 20012#L175 assume !(~P_2_pc~0 == 1); 20013#L175-2 is_P_2_triggered_~__retres1~1 := 0; 20014#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 20015#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 20057#L475 assume !(activate_threads_~tmp___0~1 != 0); 20016#L475-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 20017#L257 assume !(~C_1_pc~0 == 1); 20116#L257-2 assume !(~C_1_pc~0 == 2); 20117#L267-1 is_C_1_triggered_~__retres1~2 := 0; 20189#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 20127#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 20065#L483 assume !(activate_threads_~tmp___1~1 != 0); 20066#L483-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 20074#L421 assume { :end_inline_reset_delta_events } true; 20199#L537-3 assume true; 21541#L537-1 assume !false; 21477#L538 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 21472#L386 [2018-11-10 03:37:59,595 INFO L795 eck$LassoCheckResult]: Loop: 21472#L386 assume true; 20283#L346-1 assume !false; 20278#L347 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 20271#L317 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 20272#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 21443#L335 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 20253#L351 assume eval_~tmp___2~0 != 0; 20248#L351-1 assume ~P_1_st~0 == 0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 20244#L360 assume !(eval_~tmp~0 != 0); 20245#L356 assume !(~P_2_st~0 == 0); 21475#L371 assume !(~C_1_st~0 == 0); 21472#L386 [2018-11-10 03:37:59,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:37:59,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1990317737, now seen corresponding path program 1 times [2018-11-10 03:37:59,595 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:37:59,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:37:59,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:59,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:37:59,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:59,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:37:59,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:37:59,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:37:59,607 INFO L82 PathProgramCache]: Analyzing trace with hash 2000037912, now seen corresponding path program 1 times [2018-11-10 03:37:59,607 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:37:59,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:37:59,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:59,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:37:59,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:59,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:37:59,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:37:59,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:37:59,611 INFO L82 PathProgramCache]: Analyzing trace with hash -825812880, now seen corresponding path program 1 times [2018-11-10 03:37:59,611 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:37:59,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:37:59,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:59,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:37:59,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:59,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:37:59,657 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 03:37:59,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:37:59,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:37:59,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:37:59,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:37:59,684 INFO L87 Difference]: Start difference. First operand 1892 states and 2437 transitions. cyclomatic complexity: 548 Second operand 3 states. [2018-11-10 03:37:59,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:37:59,719 INFO L93 Difference]: Finished difference Result 3049 states and 3877 transitions. [2018-11-10 03:37:59,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:37:59,720 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3049 states and 3877 transitions. [2018-11-10 03:37:59,727 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2967 [2018-11-10 03:37:59,734 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3049 states to 3049 states and 3877 transitions. [2018-11-10 03:37:59,734 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3049 [2018-11-10 03:37:59,735 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3049 [2018-11-10 03:37:59,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3049 states and 3877 transitions. [2018-11-10 03:37:59,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:37:59,738 INFO L705 BuchiCegarLoop]: Abstraction has 3049 states and 3877 transitions. [2018-11-10 03:37:59,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3049 states and 3877 transitions. [2018-11-10 03:37:59,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3049 to 2949. [2018-11-10 03:37:59,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2949 states. [2018-11-10 03:37:59,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2949 states and 3757 transitions. [2018-11-10 03:37:59,762 INFO L728 BuchiCegarLoop]: Abstraction has 2949 states and 3757 transitions. [2018-11-10 03:37:59,762 INFO L608 BuchiCegarLoop]: Abstraction has 2949 states and 3757 transitions. [2018-11-10 03:37:59,762 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-10 03:37:59,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2949 states and 3757 transitions. [2018-11-10 03:37:59,769 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2867 [2018-11-10 03:37:59,769 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:37:59,769 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:37:59,769 INFO L866 BuchiCegarLoop]: Counterexample stem 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] [2018-11-10 03:37:59,769 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:37:59,770 INFO L793 eck$LassoCheckResult]: Stem: 25158#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 24984#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 24985#L589 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 25088#L287 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 25089#L294 assume ~P_1_i~0 == 1;~P_1_st~0 := 0; 25172#L294-2 assume !(~P_2_i~0 == 1);~P_2_st~0 := 2; 24986#L299-1 assume ~C_1_i~0 == 1;~C_1_st~0 := 0; 24987#L304-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 25047#L413 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 25123#L107 assume !(~P_1_pc~0 == 1); 25151#L107-2 is_P_1_triggered_~__retres1~0 := 0; 25152#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 25104#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 25105#L467 assume !(activate_threads_~tmp~1 != 0); 25194#L467-2 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 24961#L175 assume !(~P_2_pc~0 == 1); 24962#L175-2 is_P_2_triggered_~__retres1~1 := 0; 24963#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 24964#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 25003#L475 assume !(activate_threads_~tmp___0~1 != 0); 24965#L475-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 24966#L257 assume !(~C_1_pc~0 == 1); 25077#L257-2 assume !(~C_1_pc~0 == 2); 26639#L267-1 is_C_1_triggered_~__retres1~2 := 0; 26637#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 26634#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 26630#L483 assume !(activate_threads_~tmp___1~1 != 0); 26628#L483-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 26626#L421 assume { :end_inline_reset_delta_events } true; 26624#L537-3 assume true; 26621#L537-1 assume !false; 26598#L538 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 26594#L386 [2018-11-10 03:37:59,770 INFO L795 eck$LassoCheckResult]: Loop: 26594#L386 assume true; 26592#L346-1 assume !false; 26590#L347 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 26588#L317 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 26586#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 26584#L335 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 25808#L351 assume eval_~tmp___2~0 != 0; 25804#L351-1 assume ~P_1_st~0 == 0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 25801#L360 assume !(eval_~tmp~0 != 0); 25802#L356 assume !(~P_2_st~0 == 0); 26596#L371 assume !(~C_1_st~0 == 0); 26594#L386 [2018-11-10 03:37:59,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:37:59,770 INFO L82 PathProgramCache]: Analyzing trace with hash -381421525, now seen corresponding path program 1 times [2018-11-10 03:37:59,770 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:37:59,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:37:59,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:59,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:37:59,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:59,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:37:59,793 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 03:37:59,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:37:59,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:37:59,793 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:37:59,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:37:59,793 INFO L82 PathProgramCache]: Analyzing trace with hash 2000037912, now seen corresponding path program 2 times [2018-11-10 03:37:59,793 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:37:59,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:37:59,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:59,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:37:59,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:59,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:37:59,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:37:59,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:37:59,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:37:59,827 INFO L87 Difference]: Start difference. First operand 2949 states and 3757 transitions. cyclomatic complexity: 811 Second operand 3 states. [2018-11-10 03:37:59,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:37:59,836 INFO L93 Difference]: Finished difference Result 2923 states and 3730 transitions. [2018-11-10 03:37:59,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:37:59,839 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2923 states and 3730 transitions. [2018-11-10 03:37:59,845 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2867 [2018-11-10 03:37:59,853 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2923 states to 2923 states and 3730 transitions. [2018-11-10 03:37:59,853 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2923 [2018-11-10 03:37:59,854 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2923 [2018-11-10 03:37:59,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2923 states and 3730 transitions. [2018-11-10 03:37:59,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:37:59,856 INFO L705 BuchiCegarLoop]: Abstraction has 2923 states and 3730 transitions. [2018-11-10 03:37:59,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2923 states and 3730 transitions. [2018-11-10 03:37:59,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2923 to 2923. [2018-11-10 03:37:59,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2923 states. [2018-11-10 03:37:59,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2923 states to 2923 states and 3730 transitions. [2018-11-10 03:37:59,879 INFO L728 BuchiCegarLoop]: Abstraction has 2923 states and 3730 transitions. [2018-11-10 03:37:59,879 INFO L608 BuchiCegarLoop]: Abstraction has 2923 states and 3730 transitions. [2018-11-10 03:37:59,879 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-10 03:37:59,879 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2923 states and 3730 transitions. [2018-11-10 03:37:59,885 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2867 [2018-11-10 03:37:59,885 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:37:59,885 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:37:59,886 INFO L866 BuchiCegarLoop]: Counterexample stem 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] [2018-11-10 03:37:59,886 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:37:59,886 INFO L793 eck$LassoCheckResult]: Stem: 31039#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 30862#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 30863#L589 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 30971#L287 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 30972#L294 assume ~P_1_i~0 == 1;~P_1_st~0 := 0; 31053#L294-2 assume ~P_2_i~0 == 1;~P_2_st~0 := 0; 30866#L299-1 assume ~C_1_i~0 == 1;~C_1_st~0 := 0; 30867#L304-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 30930#L413 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 31004#L107 assume !(~P_1_pc~0 == 1); 31030#L107-2 is_P_1_triggered_~__retres1~0 := 0; 31031#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 30988#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 30989#L467 assume !(activate_threads_~tmp~1 != 0); 31072#L467-2 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 30839#L175 assume !(~P_2_pc~0 == 1); 30840#L175-2 is_P_2_triggered_~__retres1~1 := 0; 30841#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 30842#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 30884#L475 assume !(activate_threads_~tmp___0~1 != 0); 30843#L475-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 30844#L257 assume !(~C_1_pc~0 == 1); 30950#L257-2 assume !(~C_1_pc~0 == 2); 30951#L267-1 is_C_1_triggered_~__retres1~2 := 0; 31035#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 30961#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 30890#L483 assume !(activate_threads_~tmp___1~1 != 0); 30891#L483-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 30900#L421 assume { :end_inline_reset_delta_events } true; 31051#L537-3 assume true; 32577#L537-1 assume !false; 32481#L538 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 32475#L386 [2018-11-10 03:37:59,886 INFO L795 eck$LassoCheckResult]: Loop: 32475#L386 assume true; 32473#L346-1 assume !false; 32471#L347 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 32469#L317 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 32467#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 32465#L335 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 32463#L351 assume eval_~tmp___2~0 != 0; 32461#L351-1 assume ~P_1_st~0 == 0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 32459#L360 assume !(eval_~tmp~0 != 0); 32115#L356 assume ~P_2_st~0 == 0;eval_~tmp___0~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 32112#L375 assume !(eval_~tmp___0~0 != 0); 32113#L371 assume !(~C_1_st~0 == 0); 32475#L386 [2018-11-10 03:37:59,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:37:59,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1990317737, now seen corresponding path program 2 times [2018-11-10 03:37:59,886 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:37:59,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:37:59,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:59,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:37:59,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:59,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:37:59,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:37:59,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:37:59,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1871491567, now seen corresponding path program 1 times [2018-11-10 03:37:59,894 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:37:59,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:37:59,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:59,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:37:59,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:59,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:37:59,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:37:59,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:37:59,898 INFO L82 PathProgramCache]: Analyzing trace with hash 169462935, now seen corresponding path program 1 times [2018-11-10 03:37:59,898 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:37:59,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:37:59,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:59,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:37:59,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:59,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:37:59,926 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 03:37:59,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:37:59,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 03:37:59,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:37:59,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:37:59,959 INFO L87 Difference]: Start difference. First operand 2923 states and 3730 transitions. cyclomatic complexity: 810 Second operand 3 states. [2018-11-10 03:37:59,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:37:59,989 INFO L93 Difference]: Finished difference Result 4814 states and 6084 transitions. [2018-11-10 03:37:59,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:37:59,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4814 states and 6084 transitions. [2018-11-10 03:37:59,999 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 4734 [2018-11-10 03:38:00,009 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4814 states to 4814 states and 6084 transitions. [2018-11-10 03:38:00,009 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4814 [2018-11-10 03:38:00,011 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4814 [2018-11-10 03:38:00,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4814 states and 6084 transitions. [2018-11-10 03:38:00,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:38:00,015 INFO L705 BuchiCegarLoop]: Abstraction has 4814 states and 6084 transitions. [2018-11-10 03:38:00,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4814 states and 6084 transitions. [2018-11-10 03:38:00,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4814 to 4814. [2018-11-10 03:38:00,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4814 states. [2018-11-10 03:38:00,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4814 states to 4814 states and 6084 transitions. [2018-11-10 03:38:00,050 INFO L728 BuchiCegarLoop]: Abstraction has 4814 states and 6084 transitions. [2018-11-10 03:38:00,050 INFO L608 BuchiCegarLoop]: Abstraction has 4814 states and 6084 transitions. [2018-11-10 03:38:00,050 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-10 03:38:00,050 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4814 states and 6084 transitions. [2018-11-10 03:38:00,059 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 4734 [2018-11-10 03:38:00,059 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:38:00,059 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:38:00,060 INFO L866 BuchiCegarLoop]: Counterexample stem 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] [2018-11-10 03:38:00,060 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:38:00,060 INFO L793 eck$LassoCheckResult]: Stem: 38780#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 38608#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 38609#L589 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 38711#L287 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 38712#L294 assume ~P_1_i~0 == 1;~P_1_st~0 := 0; 38797#L294-2 assume ~P_2_i~0 == 1;~P_2_st~0 := 0; 38610#L299-1 assume ~C_1_i~0 == 1;~C_1_st~0 := 0; 38611#L304-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 38671#L413 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 38752#L107 assume !(~P_1_pc~0 == 1); 38772#L107-2 is_P_1_triggered_~__retres1~0 := 0; 38773#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 38729#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 38730#L467 assume !(activate_threads_~tmp~1 != 0); 38813#L467-2 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 38584#L175 assume !(~P_2_pc~0 == 1); 38585#L175-2 is_P_2_triggered_~__retres1~1 := 0; 38586#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 38587#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 38627#L475 assume !(activate_threads_~tmp___0~1 != 0); 38588#L475-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 38589#L257 assume !(~C_1_pc~0 == 1); 38691#L257-2 assume !(~C_1_pc~0 == 2); 38692#L267-1 is_C_1_triggered_~__retres1~2 := 0; 38777#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 38704#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 38636#L483 assume !(activate_threads_~tmp___1~1 != 0); 38637#L483-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 38646#L421 assume { :end_inline_reset_delta_events } true; 38791#L537-3 assume true; 40277#L537-1 assume !false; 40258#L538 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 40257#L386 [2018-11-10 03:38:00,060 INFO L795 eck$LassoCheckResult]: Loop: 40257#L386 assume true; 40256#L346-1 assume !false; 40254#L347 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 40252#L317 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 40251#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 40248#L335 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 40246#L351 assume eval_~tmp___2~0 != 0; 40245#L351-1 assume ~P_1_st~0 == 0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 40242#L360 assume !(eval_~tmp~0 != 0); 40243#L356 assume ~P_2_st~0 == 0;eval_~tmp___0~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 40755#L375 assume !(eval_~tmp___0~0 != 0); 40263#L371 assume ~C_1_st~0 == 0;eval_~tmp___1~0 := eval_#t~nondet4;havoc eval_#t~nondet4; 40259#L390 assume !(eval_~tmp___1~0 != 0); 40257#L386 [2018-11-10 03:38:00,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:38:00,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1990317737, now seen corresponding path program 3 times [2018-11-10 03:38:00,061 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:38:00,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:38:00,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:38:00,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:38:00,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:38:00,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:38:00,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:38:00,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:38:00,068 INFO L82 PathProgramCache]: Analyzing trace with hash -2113305569, now seen corresponding path program 1 times [2018-11-10 03:38:00,068 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:38:00,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:38:00,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:38:00,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:38:00,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:38:00,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:38:00,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:38:00,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:38:00,073 INFO L82 PathProgramCache]: Analyzing trace with hash 958381687, now seen corresponding path program 1 times [2018-11-10 03:38:00,073 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:38:00,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:38:00,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:38:00,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:38:00,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:38:00,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:38:00,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:38:00,319 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 94 [2018-11-10 03:38:00,445 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2018-11-10 03:38:00,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 03:38:00 BoogieIcfgContainer [2018-11-10 03:38:00,468 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 03:38:00,469 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 03:38:00,469 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 03:38:00,469 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 03:38:00,469 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:37:53" (3/4) ... [2018-11-10 03:38:00,471 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-10 03:38:00,513 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_270d281e-1610-47b1-941d-32db288cdcd7/bin-2019/uautomizer/witness.graphml [2018-11-10 03:38:00,514 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 03:38:00,514 INFO L168 Benchmark]: Toolchain (without parser) took 7467.15 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 369.1 MB). Free memory was 959.7 MB in the beginning and 1.0 GB in the end (delta: -65.4 MB). Peak memory consumption was 303.7 MB. Max. memory is 11.5 GB. [2018-11-10 03:38:00,515 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:38:00,515 INFO L168 Benchmark]: CACSL2BoogieTranslator took 243.89 ms. Allocated memory is still 1.0 GB. Free memory was 959.7 MB in the beginning and 943.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-10 03:38:00,515 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.37 ms. Allocated memory is still 1.0 GB. Free memory was 943.6 MB in the beginning and 941.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 03:38:00,515 INFO L168 Benchmark]: Boogie Preprocessor took 78.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 194.0 MB). Free memory was 941.0 MB in the beginning and 1.2 GB in the end (delta: -247.9 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-10 03:38:00,516 INFO L168 Benchmark]: RCFGBuilder took 462.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 11.5 GB. [2018-11-10 03:38:00,516 INFO L168 Benchmark]: BuchiAutomizer took 6598.49 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 175.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 105.3 MB). Peak memory consumption was 280.4 MB. Max. memory is 11.5 GB. [2018-11-10 03:38:00,516 INFO L168 Benchmark]: Witness Printer took 45.12 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. [2018-11-10 03:38:00,518 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.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 243.89 ms. Allocated memory is still 1.0 GB. Free memory was 959.7 MB in the beginning and 943.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.37 ms. Allocated memory is still 1.0 GB. Free memory was 943.6 MB in the beginning and 941.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 78.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 194.0 MB). Free memory was 941.0 MB in the beginning and 1.2 GB in the end (delta: -247.9 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 462.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6598.49 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 175.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 105.3 MB). Peak memory consumption was 280.4 MB. Max. memory is 11.5 GB. * Witness Printer took 45.12 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. 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 14 terminating modules (14 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.14 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 4814 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.5s and 15 iterations. TraceHistogramMax:2. Analysis of lassos took 4.9s. Construction of modules took 0.6s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 0. Minimization of det autom 14. Minimization of nondet autom 0. Automata minimization 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 4048 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 4814 states and ocurred in iteration 14. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 3716 SDtfs, 4708 SDslu, 4923 SDs, 0 SdLazy, 311 SolverSat, 122 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont1 unkn0 SFLI5 SFLT0 conc3 concLT0 SILN1 SILU0 SILI5 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital89 mio100 ax100 hnf100 lsp12 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq209 hnf86 smp100 dnf189 smp63 tf108 neg92 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 23ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 15 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 346]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {count=0, \result=0, P_1_pc=0, C_1_i=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5219ead=0, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4b8b0d58=0, C_1_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@21823ffb=0, data_0=0, kernel_st=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@21617c01=0, tmp___2=1, tmp___0=0, \result=0, i=0, P_1_i=1, e=0, P_2_pc=0, __retres1=0, tmp___0=0, num=0, P_1_ev=0, tmp=0, C_1_pc=0, P_2_st=0, P_2_i=1, \result=0, __retres1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6ba679e9=0, tmp___0=0, __retres1=0, tmp___1=0, data_1=0, __retres1=1, \result=0, max_loop=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4eab5e8b=0, tmp=0, C_1_pr=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3eddcfd4=0, P_1_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@27d2d7cf=0, P_2_ev=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@42b44c38=0, C_1_ev=0, tmp___1=0, timer=0, __retres2=0, \result=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 346]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L15] int max_loop ; [L16] int num ; [L17] int i ; [L18] int e ; [L19] int timer ; [L20] char data_0 ; [L21] char data_1 ; [L64] int P_1_pc; [L65] int P_1_st ; [L66] int P_1_i ; [L67] int P_1_ev ; [L122] int P_2_pc ; [L123] int P_2_st ; [L124] int P_2_i ; [L125] int P_2_ev ; [L190] int C_1_pc ; [L191] int C_1_st ; [L192] int C_1_i ; [L193] int C_1_ev ; [L194] int C_1_pr ; [L593] int count ; [L594] int __retres2 ; [L598] num = 0 [L599] i = 0 [L600] max_loop = 2 [L602] timer = 0 [L603] P_1_pc = 0 [L604] P_2_pc = 0 [L605] C_1_pc = 0 [L607] count = 0 [L608] CALL init_model() [L585] P_1_i = 1 [L586] P_2_i = 1 [L587] RET C_1_i = 1 [L608] init_model() [L609] CALL start_simulation() [L523] int kernel_st ; [L524] int tmp ; [L525] int tmp___0 ; [L529] kernel_st = 0 [L530] FCALL update_channels() [L531] CALL init_threads() [L294] COND TRUE (int )P_1_i == 1 [L295] P_1_st = 0 [L299] COND TRUE (int )P_2_i == 1 [L300] P_2_st = 0 [L304] COND TRUE (int )C_1_i == 1 [L305] RET C_1_st = 0 [L531] init_threads() [L532] FCALL fire_delta_events() [L533] CALL activate_threads() [L459] int tmp ; [L460] int tmp___0 ; [L461] int tmp___1 ; [L465] CALL, EXPR is_P_1_triggered() [L104] int __retres1 ; [L107] COND FALSE !((int )P_1_pc == 1) [L117] __retres1 = 0 [L119] RET return (__retres1); [L465] EXPR is_P_1_triggered() [L465] tmp = is_P_1_triggered() [L467] COND FALSE !(\read(tmp)) [L473] CALL, EXPR is_P_2_triggered() [L172] int __retres1 ; [L175] COND FALSE !((int )P_2_pc == 1) [L185] __retres1 = 0 [L187] RET return (__retres1); [L473] EXPR is_P_2_triggered() [L473] tmp___0 = is_P_2_triggered() [L475] COND FALSE !(\read(tmp___0)) [L481] CALL, EXPR is_C_1_triggered() [L254] int __retres1 ; [L257] COND FALSE !((int )C_1_pc == 1) [L267] COND FALSE !((int )C_1_pc == 2) [L277] __retres1 = 0 [L279] RET return (__retres1); [L481] EXPR is_C_1_triggered() [L481] tmp___1 = is_C_1_triggered() [L483] COND FALSE, RET !(\read(tmp___1)) [L533] activate_threads() [L534] FCALL reset_delta_events() [L537] COND TRUE 1 [L540] kernel_st = 1 [L541] CALL eval() [L339] int tmp ; [L340] int tmp___0 ; [L341] int tmp___1 ; [L342] int tmp___2 ; Loop: [L346] COND TRUE 1 [L349] CALL, EXPR exists_runnable_thread() [L314] int __retres1 ; [L317] COND TRUE (int )P_1_st == 0 [L318] __retres1 = 1 [L335] RET return (__retres1); [L349] EXPR exists_runnable_thread() [L349] tmp___2 = exists_runnable_thread() [L351] COND TRUE \read(tmp___2) [L356] COND TRUE (int )P_1_st == 0 [L358] tmp = __VERIFIER_nondet_int() [L360] COND FALSE !(\read(tmp)) [L371] COND TRUE (int )P_2_st == 0 [L373] tmp___0 = __VERIFIER_nondet_int() [L375] COND FALSE !(\read(tmp___0)) [L386] COND TRUE (int )C_1_st == 0 [L388] tmp___1 = __VERIFIER_nondet_int() [L390] COND FALSE !(\read(tmp___1)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...