./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 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6d7bd90f-0818-41e1-9736-40ecb781fa9a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6d7bd90f-0818-41e1-9736-40ecb781fa9a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6d7bd90f-0818-41e1-9736-40ecb781fa9a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6d7bd90f-0818-41e1-9736-40ecb781fa9a/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_6d7bd90f-0818-41e1-9736-40ecb781fa9a/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6d7bd90f-0818-41e1-9736-40ecb781fa9a/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-5842f4b [2018-11-18 13:52:49,384 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 13:52:49,385 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 13:52:49,392 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 13:52:49,393 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 13:52:49,393 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 13:52:49,394 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 13:52:49,395 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 13:52:49,396 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 13:52:49,397 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 13:52:49,397 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 13:52:49,398 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 13:52:49,398 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 13:52:49,399 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 13:52:49,400 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 13:52:49,400 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 13:52:49,401 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 13:52:49,402 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 13:52:49,403 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 13:52:49,404 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 13:52:49,405 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 13:52:49,406 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 13:52:49,407 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 13:52:49,408 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 13:52:49,408 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 13:52:49,408 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 13:52:49,409 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 13:52:49,410 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 13:52:49,410 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 13:52:49,411 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 13:52:49,411 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 13:52:49,412 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 13:52:49,412 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 13:52:49,412 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 13:52:49,412 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 13:52:49,413 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 13:52:49,413 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6d7bd90f-0818-41e1-9736-40ecb781fa9a/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 13:52:49,424 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 13:52:49,424 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 13:52:49,425 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 13:52:49,425 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 13:52:49,425 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 13:52:49,426 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 13:52:49,426 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 13:52:49,426 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 13:52:49,426 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 13:52:49,426 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 13:52:49,426 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 13:52:49,427 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 13:52:49,427 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 13:52:49,427 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 13:52:49,427 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 13:52:49,427 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 13:52:49,427 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 13:52:49,427 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 13:52:49,427 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 13:52:49,428 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 13:52:49,428 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 13:52:49,428 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 13:52:49,428 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 13:52:49,428 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 13:52:49,428 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 13:52:49,428 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 13:52:49,428 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 13:52:49,429 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 13:52:49,429 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 13:52:49,429 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 13:52:49,429 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 13:52:49,430 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 13:52:49,430 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_6d7bd90f-0818-41e1-9736-40ecb781fa9a/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-18 13:52:49,451 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 13:52:49,460 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 13:52:49,463 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 13:52:49,464 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 13:52:49,465 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 13:52:49,466 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6d7bd90f-0818-41e1-9736-40ecb781fa9a/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/kundu2_false-unreach-call_false-termination.cil.c [2018-11-18 13:52:49,501 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6d7bd90f-0818-41e1-9736-40ecb781fa9a/bin-2019/uautomizer/data/1a7694c71/130d8d1505d64d01ab968b55debbd157/FLAG9dbbe7104 [2018-11-18 13:52:49,909 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 13:52:49,910 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6d7bd90f-0818-41e1-9736-40ecb781fa9a/sv-benchmarks/c/systemc/kundu2_false-unreach-call_false-termination.cil.c [2018-11-18 13:52:49,915 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6d7bd90f-0818-41e1-9736-40ecb781fa9a/bin-2019/uautomizer/data/1a7694c71/130d8d1505d64d01ab968b55debbd157/FLAG9dbbe7104 [2018-11-18 13:52:49,925 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6d7bd90f-0818-41e1-9736-40ecb781fa9a/bin-2019/uautomizer/data/1a7694c71/130d8d1505d64d01ab968b55debbd157 [2018-11-18 13:52:49,927 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 13:52:49,928 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 13:52:49,929 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 13:52:49,929 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 13:52:49,931 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 13:52:49,931 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:52:49" (1/1) ... [2018-11-18 13:52:49,933 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f003888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:52:49, skipping insertion in model container [2018-11-18 13:52:49,933 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:52:49" (1/1) ... [2018-11-18 13:52:49,941 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 13:52:49,967 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 13:52:50,096 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:52:50,100 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 13:52:50,124 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:52:50,134 INFO L195 MainTranslator]: Completed translation [2018-11-18 13:52:50,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:52:50 WrapperNode [2018-11-18 13:52:50,134 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 13:52:50,135 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 13:52:50,135 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 13:52:50,135 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 13:52:50,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:52:50" (1/1) ... [2018-11-18 13:52:50,149 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:52:50" (1/1) ... [2018-11-18 13:52:50,213 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 13:52:50,214 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 13:52:50,214 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 13:52:50,214 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 13:52:50,222 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:52:50" (1/1) ... [2018-11-18 13:52:50,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:52:50" (1/1) ... [2018-11-18 13:52:50,224 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:52:50" (1/1) ... [2018-11-18 13:52:50,224 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:52:50" (1/1) ... [2018-11-18 13:52:50,230 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:52:50" (1/1) ... [2018-11-18 13:52:50,238 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:52:50" (1/1) ... [2018-11-18 13:52:50,239 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:52:50" (1/1) ... [2018-11-18 13:52:50,242 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 13:52:50,243 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 13:52:50,243 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 13:52:50,243 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 13:52:50,244 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:52:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6d7bd90f-0818-41e1-9736-40ecb781fa9a/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:52:50,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 13:52:50,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 13:52:50,724 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 13:52:50,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:52:50 BoogieIcfgContainer [2018-11-18 13:52:50,725 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 13:52:50,725 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 13:52:50,725 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 13:52:50,728 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 13:52:50,729 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:52:50,729 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 01:52:49" (1/3) ... [2018-11-18 13:52:50,730 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a897615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 01:52:50, skipping insertion in model container [2018-11-18 13:52:50,730 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:52:50,730 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:52:50" (2/3) ... [2018-11-18 13:52:50,731 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a897615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 01:52:50, skipping insertion in model container [2018-11-18 13:52:50,731 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:52:50,731 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:52:50" (3/3) ... [2018-11-18 13:52:50,732 INFO L375 chiAutomizerObserver]: Analyzing ICFG kundu2_false-unreach-call_false-termination.cil.c [2018-11-18 13:52:50,779 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 13:52:50,780 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 13:52:50,780 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 13:52:50,780 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 13:52:50,780 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 13:52:50,780 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 13:52:50,780 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 13:52:50,781 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 13:52:50,781 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 13:52:50,797 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 195 states. [2018-11-18 13:52:50,819 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 158 [2018-11-18 13:52:50,820 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:52:50,820 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:52:50,826 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-18 13:52:50,826 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-18 13:52:50,826 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 13:52:50,826 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 195 states. [2018-11-18 13:52:50,830 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 158 [2018-11-18 13:52:50,831 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:52:50,831 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:52:50,832 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-18 13:52:50,832 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-18 13:52:50,837 INFO L794 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 !(1 == ~P_1_i~0);~P_1_st~0 := 2; 190#L294-2true assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 132#L299-1true assume !(1 == ~C_1_i~0);~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 !(1 == ~P_1_pc~0); 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 0 != activate_threads_~tmp~1;~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 1 == ~P_2_pc~0; 84#L176true assume 1 == ~P_2_ev~0;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 !(0 != activate_threads_~tmp___0~1); 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 1 == ~C_1_pc~0; 119#L258true assume 1 == ~e~0;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 !(0 != activate_threads_~tmp___1~1); 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-18 13:52:50,838 INFO L796 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 !(1 == ~P_1_pc~0); 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 !(0 != activate_threads_~tmp~1); 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 !(1 == ~P_2_pc~0); 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 0 != activate_threads_~tmp___0~1;~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 1 == ~C_1_pc~0; 115#L258-2true assume 1 == ~e~0;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 0 != activate_threads_~tmp___1~1;~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 0 == ~P_1_st~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 !(0 == start_simulation_~tmp~3); 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 0 == ~P_1_st~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 0 != stop_simulation_~tmp~2;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 !(0 != start_simulation_~tmp___0~2); 152#L537-3true [2018-11-18 13:52:50,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:52:50,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1332213672, now seen corresponding path program 1 times [2018-11-18 13:52:50,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:52:50,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:52:50,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:50,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:52:50,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:50,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:52:50,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:52:50,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:52:50,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:52:50,948 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:52:50,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:52:50,949 INFO L82 PathProgramCache]: Analyzing trace with hash -799421162, now seen corresponding path program 1 times [2018-11-18 13:52:50,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:52:50,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:52:50,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:50,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:52:50,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:50,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:52:50,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:52:50,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:52:50,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 13:52:50,959 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:52:50,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:52:50,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:52:50,970 INFO L87 Difference]: Start difference. First operand 195 states. Second operand 3 states. [2018-11-18 13:52:50,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:52:50,991 INFO L93 Difference]: Finished difference Result 191 states and 273 transitions. [2018-11-18 13:52:50,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:52:50,994 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 191 states and 273 transitions. [2018-11-18 13:52:50,996 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 150 [2018-11-18 13:52:51,000 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 191 states to 183 states and 265 transitions. [2018-11-18 13:52:51,001 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 183 [2018-11-18 13:52:51,002 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 183 [2018-11-18 13:52:51,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 183 states and 265 transitions. [2018-11-18 13:52:51,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:52:51,004 INFO L705 BuchiCegarLoop]: Abstraction has 183 states and 265 transitions. [2018-11-18 13:52:51,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states and 265 transitions. [2018-11-18 13:52:51,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-11-18 13:52:51,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-11-18 13:52:51,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 265 transitions. [2018-11-18 13:52:51,036 INFO L728 BuchiCegarLoop]: Abstraction has 183 states and 265 transitions. [2018-11-18 13:52:51,036 INFO L608 BuchiCegarLoop]: Abstraction has 183 states and 265 transitions. [2018-11-18 13:52:51,036 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 13:52:51,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 183 states and 265 transitions. [2018-11-18 13:52:51,038 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 150 [2018-11-18 13:52:51,038 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:52:51,038 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:52:51,040 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-18 13:52:51,040 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-18 13:52:51,040 INFO L794 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 1 == ~P_1_i~0;~P_1_st~0 := 0; 567#L294-2 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 426#L299-1 assume !(1 == ~C_1_i~0);~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 !(1 == ~P_1_pc~0); 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 0 != activate_threads_~tmp~1;~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 1 == ~P_2_pc~0; 396#L176 assume 1 == ~P_2_ev~0;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 !(0 != activate_threads_~tmp___0~1); 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 1 == ~C_1_pc~0; 512#L258 assume 1 == ~e~0;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 !(0 != activate_threads_~tmp___1~1); 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-18 13:52:51,040 INFO L796 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 0 == ~P_1_st~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 !(0 != eval_~tmp___2~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 1 == ~P_1_pc~0; 524#L108-2 assume 1 == ~P_1_ev~0;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 !(0 != activate_threads_~tmp~1); 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 1 == ~P_2_pc~0; 564#L176-2 assume 1 == ~P_2_ev~0;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 0 != activate_threads_~tmp___0~1;~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 1 == ~C_1_pc~0; 455#L258-2 assume 1 == ~e~0;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 0 != activate_threads_~tmp___1~1;~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 0 == ~P_1_st~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 !(0 == start_simulation_~tmp~3); 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 0 == ~P_1_st~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 0 != stop_simulation_~tmp~2;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 !(0 != start_simulation_~tmp___0~2); 546#L537-3 [2018-11-18 13:52:51,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:52:51,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1466227178, now seen corresponding path program 1 times [2018-11-18 13:52:51,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:52:51,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:52:51,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:51,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:52:51,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:51,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:52:51,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:52:51,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:52:51,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:52:51,081 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:52:51,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:52:51,081 INFO L82 PathProgramCache]: Analyzing trace with hash 469106883, now seen corresponding path program 1 times [2018-11-18 13:52:51,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:52:51,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:52:51,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:51,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:52:51,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:51,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:52:51,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:52:51,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:52:51,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:52:51,126 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:52:51,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:52:51,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:52:51,126 INFO L87 Difference]: Start difference. First operand 183 states and 265 transitions. cyclomatic complexity: 83 Second operand 3 states. [2018-11-18 13:52:51,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:52:51,136 INFO L93 Difference]: Finished difference Result 183 states and 264 transitions. [2018-11-18 13:52:51,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:52:51,138 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 183 states and 264 transitions. [2018-11-18 13:52:51,140 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 150 [2018-11-18 13:52:51,142 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 183 states to 183 states and 264 transitions. [2018-11-18 13:52:51,142 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 183 [2018-11-18 13:52:51,143 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 183 [2018-11-18 13:52:51,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 183 states and 264 transitions. [2018-11-18 13:52:51,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:52:51,144 INFO L705 BuchiCegarLoop]: Abstraction has 183 states and 264 transitions. [2018-11-18 13:52:51,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states and 264 transitions. [2018-11-18 13:52:51,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-11-18 13:52:51,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-11-18 13:52:51,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 264 transitions. [2018-11-18 13:52:51,151 INFO L728 BuchiCegarLoop]: Abstraction has 183 states and 264 transitions. [2018-11-18 13:52:51,152 INFO L608 BuchiCegarLoop]: Abstraction has 183 states and 264 transitions. [2018-11-18 13:52:51,152 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 13:52:51,152 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 183 states and 264 transitions. [2018-11-18 13:52:51,153 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 150 [2018-11-18 13:52:51,153 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:52:51,154 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:52:51,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-18 13:52:51,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-18 13:52:51,156 INFO L794 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 1 == ~P_1_i~0;~P_1_st~0 := 0; 942#L294-2 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 799#L299-1 assume 1 == ~C_1_i~0;~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 !(1 == ~P_1_pc~0); 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 0 != activate_threads_~tmp~1;~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 1 == ~P_2_pc~0; 771#L176 assume 1 == ~P_2_ev~0;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 !(0 != activate_threads_~tmp___0~1); 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 1 == ~C_1_pc~0; 887#L258 assume 1 == ~e~0;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 !(0 != activate_threads_~tmp___1~1); 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-18 13:52:51,156 INFO L796 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 0 == ~P_1_st~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 !(0 != eval_~tmp___2~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 1 == ~P_1_pc~0; 899#L108-2 assume 1 == ~P_1_ev~0;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 !(0 != activate_threads_~tmp~1); 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 1 == ~P_2_pc~0; 939#L176-2 assume 1 == ~P_2_ev~0;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 0 != activate_threads_~tmp___0~1;~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 1 == ~C_1_pc~0; 830#L258-2 assume 1 == ~e~0;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 0 != activate_threads_~tmp___1~1;~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 0 == ~P_1_st~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 !(0 == start_simulation_~tmp~3); 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 0 == ~P_1_st~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 0 != stop_simulation_~tmp~2;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 !(0 != start_simulation_~tmp___0~2); 921#L537-3 [2018-11-18 13:52:51,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:52:51,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1247372460, now seen corresponding path program 1 times [2018-11-18 13:52:51,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:52:51,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:52:51,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:51,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:52:51,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:51,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:52:51,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:52:51,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:52:51,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:52:51,197 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:52:51,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:52:51,198 INFO L82 PathProgramCache]: Analyzing trace with hash 469106883, now seen corresponding path program 2 times [2018-11-18 13:52:51,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:52:51,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:52:51,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:51,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:52:51,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:51,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:52:51,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:52:51,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:52:51,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:52:51,237 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:52:51,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:52:51,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:52:51,238 INFO L87 Difference]: Start difference. First operand 183 states and 264 transitions. cyclomatic complexity: 82 Second operand 3 states. [2018-11-18 13:52:51,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:52:51,279 INFO L93 Difference]: Finished difference Result 329 states and 470 transitions. [2018-11-18 13:52:51,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:52:51,279 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 329 states and 470 transitions. [2018-11-18 13:52:51,281 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 297 [2018-11-18 13:52:51,283 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 329 states to 329 states and 470 transitions. [2018-11-18 13:52:51,283 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 329 [2018-11-18 13:52:51,284 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 329 [2018-11-18 13:52:51,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 329 states and 470 transitions. [2018-11-18 13:52:51,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:52:51,285 INFO L705 BuchiCegarLoop]: Abstraction has 329 states and 470 transitions. [2018-11-18 13:52:51,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states and 470 transitions. [2018-11-18 13:52:51,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 313. [2018-11-18 13:52:51,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-11-18 13:52:51,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 448 transitions. [2018-11-18 13:52:51,293 INFO L728 BuchiCegarLoop]: Abstraction has 313 states and 448 transitions. [2018-11-18 13:52:51,293 INFO L608 BuchiCegarLoop]: Abstraction has 313 states and 448 transitions. [2018-11-18 13:52:51,293 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 13:52:51,293 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 313 states and 448 transitions. [2018-11-18 13:52:51,294 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 281 [2018-11-18 13:52:51,294 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:52:51,294 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:52:51,295 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-18 13:52:51,295 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-18 13:52:51,295 INFO L794 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 1 == ~P_1_i~0;~P_1_st~0 := 0; 1470#L294-2 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 1321#L299-1 assume 1 == ~C_1_i~0;~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 !(1 == ~P_1_pc~0); 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 0 != activate_threads_~tmp~1;~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 !(1 == ~P_2_pc~0); 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 !(0 != activate_threads_~tmp___0~1); 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 1 == ~C_1_pc~0; 1408#L258 assume 1 == ~e~0;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 !(0 != activate_threads_~tmp___1~1); 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-18 13:52:51,295 INFO L796 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 0 == ~P_1_st~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 !(0 != eval_~tmp___2~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 1 == ~P_1_pc~0; 1493#L108-2 assume 1 == ~P_1_ev~0;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 !(0 != activate_threads_~tmp~1); 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 !(1 == ~P_2_pc~0); 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 0 != activate_threads_~tmp___0~1;~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 1 == ~C_1_pc~0; 1595#L258-2 assume 1 == ~e~0;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 0 != activate_threads_~tmp___1~1;~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 0 == ~P_1_st~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 !(0 == start_simulation_~tmp~3); 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 0 == ~P_1_st~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 0 != stop_simulation_~tmp~2;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 !(0 != start_simulation_~tmp___0~2); 1444#L537-3 [2018-11-18 13:52:51,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:52:51,296 INFO L82 PathProgramCache]: Analyzing trace with hash -31952275, now seen corresponding path program 1 times [2018-11-18 13:52:51,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:52:51,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:52:51,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:51,297 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:52:51,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:51,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:52:51,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:52:51,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:52:51,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:52:51,318 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:52:51,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:52:51,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1588497148, now seen corresponding path program 1 times [2018-11-18 13:52:51,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:52:51,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:52:51,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:51,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:52:51,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:51,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:52:51,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:52:51,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:52:51,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:52:51,373 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:52:51,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:52:51,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:52:51,374 INFO L87 Difference]: Start difference. First operand 313 states and 448 transitions. cyclomatic complexity: 136 Second operand 3 states. [2018-11-18 13:52:51,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:52:51,438 INFO L93 Difference]: Finished difference Result 582 states and 814 transitions. [2018-11-18 13:52:51,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:52:51,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 582 states and 814 transitions. [2018-11-18 13:52:51,441 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 552 [2018-11-18 13:52:51,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 582 states to 582 states and 814 transitions. [2018-11-18 13:52:51,444 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 582 [2018-11-18 13:52:51,444 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 582 [2018-11-18 13:52:51,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 582 states and 814 transitions. [2018-11-18 13:52:51,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:52:51,445 INFO L705 BuchiCegarLoop]: Abstraction has 582 states and 814 transitions. [2018-11-18 13:52:51,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states and 814 transitions. [2018-11-18 13:52:51,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 566. [2018-11-18 13:52:51,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2018-11-18 13:52:51,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 794 transitions. [2018-11-18 13:52:51,457 INFO L728 BuchiCegarLoop]: Abstraction has 566 states and 794 transitions. [2018-11-18 13:52:51,457 INFO L608 BuchiCegarLoop]: Abstraction has 566 states and 794 transitions. [2018-11-18 13:52:51,457 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 13:52:51,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 566 states and 794 transitions. [2018-11-18 13:52:51,460 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 536 [2018-11-18 13:52:51,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:52:51,460 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:52:51,461 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-18 13:52:51,461 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-18 13:52:51,461 INFO L794 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 1 == ~P_1_i~0;~P_1_st~0 := 0; 2384#L294-2 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 2223#L299-1 assume 1 == ~C_1_i~0;~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 !(1 == ~P_1_pc~0); 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 0 != activate_threads_~tmp~1;~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 !(1 == ~P_2_pc~0); 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 !(0 != activate_threads_~tmp___0~1); 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 !(1 == ~C_1_pc~0); 2302#L257-2 assume !(2 == ~C_1_pc~0); 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 !(0 != activate_threads_~tmp___1~1); 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-18 13:52:51,461 INFO L796 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 0 == ~P_1_st~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 !(0 != eval_~tmp___2~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 1 == ~P_1_pc~0; 2325#L108-2 assume 1 == ~P_1_ev~0;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 !(0 != activate_threads_~tmp~1); 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 !(1 == ~P_2_pc~0); 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 0 != activate_threads_~tmp___0~1;~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 !(1 == ~C_1_pc~0); 2695#L257-8 assume !(2 == ~C_1_pc~0); 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 0 != activate_threads_~tmp___1~1;~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 0 == ~P_1_st~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 !(0 == start_simulation_~tmp~3); 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 0 == ~P_1_st~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 0 != stop_simulation_~tmp~2;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 !(0 != start_simulation_~tmp___0~2); 2379#L537-3 [2018-11-18 13:52:51,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:52:51,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1307353874, now seen corresponding path program 1 times [2018-11-18 13:52:51,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:52:51,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:52:51,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:51,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:52:51,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:51,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:52:51,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:52:51,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:52:51,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:52:51,522 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:52:51,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:52:51,523 INFO L82 PathProgramCache]: Analyzing trace with hash -558541837, now seen corresponding path program 1 times [2018-11-18 13:52:51,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:52:51,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:52:51,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:51,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:52:51,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:51,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:52:51,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:52:51,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:52:51,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:52:51,551 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:52:51,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:52:51,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:52:51,552 INFO L87 Difference]: Start difference. First operand 566 states and 794 transitions. cyclomatic complexity: 229 Second operand 5 states. [2018-11-18 13:52:51,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:52:51,631 INFO L93 Difference]: Finished difference Result 1563 states and 2167 transitions. [2018-11-18 13:52:51,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 13:52:51,631 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1563 states and 2167 transitions. [2018-11-18 13:52:51,638 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1500 [2018-11-18 13:52:51,643 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1563 states to 1563 states and 2167 transitions. [2018-11-18 13:52:51,643 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1563 [2018-11-18 13:52:51,645 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1563 [2018-11-18 13:52:51,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1563 states and 2167 transitions. [2018-11-18 13:52:51,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:52:51,646 INFO L705 BuchiCegarLoop]: Abstraction has 1563 states and 2167 transitions. [2018-11-18 13:52:51,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states and 2167 transitions. [2018-11-18 13:52:51,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 605. [2018-11-18 13:52:51,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2018-11-18 13:52:51,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 833 transitions. [2018-11-18 13:52:51,659 INFO L728 BuchiCegarLoop]: Abstraction has 605 states and 833 transitions. [2018-11-18 13:52:51,659 INFO L608 BuchiCegarLoop]: Abstraction has 605 states and 833 transitions. [2018-11-18 13:52:51,659 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 13:52:51,659 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 605 states and 833 transitions. [2018-11-18 13:52:51,661 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 572 [2018-11-18 13:52:51,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:52:51,661 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:52:51,662 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-18 13:52:51,662 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-18 13:52:51,662 INFO L794 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 1 == ~P_1_i~0;~P_1_st~0 := 0; 4530#L294-2 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 4367#L299-1 assume 1 == ~C_1_i~0;~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 !(1 == ~P_1_pc~0); 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 !(0 != activate_threads_~tmp~1); 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 !(1 == ~P_2_pc~0); 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 !(0 != activate_threads_~tmp___0~1); 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 !(1 == ~C_1_pc~0); 4448#L257-2 assume !(2 == ~C_1_pc~0); 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 !(0 != activate_threads_~tmp___1~1); 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-18 13:52:51,662 INFO L796 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 0 == ~P_1_st~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 !(0 != eval_~tmp___2~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 !(1 == ~P_1_pc~0); 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 !(0 != activate_threads_~tmp~1); 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 !(1 == ~P_2_pc~0); 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 0 != activate_threads_~tmp___0~1;~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 !(1 == ~C_1_pc~0); 4857#L257-8 assume !(2 == ~C_1_pc~0); 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 0 != activate_threads_~tmp___1~1;~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 0 == ~P_1_st~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 !(0 == start_simulation_~tmp~3); 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 0 == ~P_1_st~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 0 != stop_simulation_~tmp~2;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 !(0 != start_simulation_~tmp___0~2); 4525#L537-3 [2018-11-18 13:52:51,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:52:51,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1966545068, now seen corresponding path program 1 times [2018-11-18 13:52:51,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:52:51,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:52:51,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:51,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:52:51,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:51,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:52:51,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:52:51,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:52:51,689 INFO L82 PathProgramCache]: Analyzing trace with hash 360432786, now seen corresponding path program 1 times [2018-11-18 13:52:51,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:52:51,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:52:51,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:51,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:52:51,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:51,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:52:51,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:52:51,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:52:51,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:52:51,731 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:52:51,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:52:51,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:52:51,731 INFO L87 Difference]: Start difference. First operand 605 states and 833 transitions. cyclomatic complexity: 229 Second operand 5 states. [2018-11-18 13:52:51,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:52:51,792 INFO L93 Difference]: Finished difference Result 1067 states and 1457 transitions. [2018-11-18 13:52:51,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 13:52:51,793 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1067 states and 1457 transitions. [2018-11-18 13:52:51,797 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1034 [2018-11-18 13:52:51,800 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1067 states to 1067 states and 1457 transitions. [2018-11-18 13:52:51,800 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1067 [2018-11-18 13:52:51,801 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1067 [2018-11-18 13:52:51,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1067 states and 1457 transitions. [2018-11-18 13:52:51,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:52:51,802 INFO L705 BuchiCegarLoop]: Abstraction has 1067 states and 1457 transitions. [2018-11-18 13:52:51,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states and 1457 transitions. [2018-11-18 13:52:51,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 617. [2018-11-18 13:52:51,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2018-11-18 13:52:51,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 845 transitions. [2018-11-18 13:52:51,811 INFO L728 BuchiCegarLoop]: Abstraction has 617 states and 845 transitions. [2018-11-18 13:52:51,811 INFO L608 BuchiCegarLoop]: Abstraction has 617 states and 845 transitions. [2018-11-18 13:52:51,811 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 13:52:51,811 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 617 states and 845 transitions. [2018-11-18 13:52:51,813 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 584 [2018-11-18 13:52:51,813 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:52:51,814 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:52:51,814 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-18 13:52:51,814 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-18 13:52:51,814 INFO L794 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 1 == ~P_1_i~0;~P_1_st~0 := 0; 6219#L294-2 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 6055#L299-1 assume 1 == ~C_1_i~0;~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 !(1 == ~P_1_pc~0); 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 !(0 != activate_threads_~tmp~1); 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 !(1 == ~P_2_pc~0); 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 !(0 != activate_threads_~tmp___0~1); 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 !(1 == ~C_1_pc~0); 6134#L257-2 assume !(2 == ~C_1_pc~0); 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 !(0 != activate_threads_~tmp___1~1); 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-18 13:52:51,815 INFO L796 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 !(0 == ~P_1_st~0); 6334#L321 assume !(0 == ~P_2_st~0); 6328#L325 assume !(0 == ~C_1_st~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 !(0 != eval_~tmp___2~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 1 == ~P_1_pc~0; 6154#L108-2 assume 1 == ~P_1_ev~0;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 !(0 != activate_threads_~tmp~1); 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 !(1 == ~P_2_pc~0); 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 0 != activate_threads_~tmp___0~1;~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 !(1 == ~C_1_pc~0); 6085#L257-8 assume !(2 == ~C_1_pc~0); 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 0 != activate_threads_~tmp___1~1;~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 0 == ~P_1_st~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 !(0 == start_simulation_~tmp~3); 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 0 == ~P_1_st~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 0 != stop_simulation_~tmp~2;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 !(0 != start_simulation_~tmp___0~2); 6214#L537-3 [2018-11-18 13:52:51,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:52:51,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1966545068, now seen corresponding path program 2 times [2018-11-18 13:52:51,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:52:51,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:52:51,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:51,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:52:51,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:51,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:52:51,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:52:51,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:52:51,829 INFO L82 PathProgramCache]: Analyzing trace with hash 273300762, now seen corresponding path program 1 times [2018-11-18 13:52:51,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:52:51,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:52:51,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:51,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:52:51,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:51,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:52:51,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:52:51,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:52:51,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:52:51,856 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:52:51,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:52:51,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:52:51,856 INFO L87 Difference]: Start difference. First operand 617 states and 845 transitions. cyclomatic complexity: 229 Second operand 3 states. [2018-11-18 13:52:51,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:52:51,895 INFO L93 Difference]: Finished difference Result 1073 states and 1447 transitions. [2018-11-18 13:52:51,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:52:51,895 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1073 states and 1447 transitions. [2018-11-18 13:52:51,900 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1040 [2018-11-18 13:52:51,903 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1073 states to 1073 states and 1447 transitions. [2018-11-18 13:52:51,903 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1073 [2018-11-18 13:52:51,903 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1073 [2018-11-18 13:52:51,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1073 states and 1447 transitions. [2018-11-18 13:52:51,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:52:51,905 INFO L705 BuchiCegarLoop]: Abstraction has 1073 states and 1447 transitions. [2018-11-18 13:52:51,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states and 1447 transitions. [2018-11-18 13:52:51,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 1073. [2018-11-18 13:52:51,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1073 states. [2018-11-18 13:52:51,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 1073 states and 1447 transitions. [2018-11-18 13:52:51,916 INFO L728 BuchiCegarLoop]: Abstraction has 1073 states and 1447 transitions. [2018-11-18 13:52:51,916 INFO L608 BuchiCegarLoop]: Abstraction has 1073 states and 1447 transitions. [2018-11-18 13:52:51,916 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 13:52:51,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1073 states and 1447 transitions. [2018-11-18 13:52:51,920 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1040 [2018-11-18 13:52:51,920 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:52:51,921 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:52:51,921 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-18 13:52:51,921 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-18 13:52:51,921 INFO L794 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 1 == ~P_1_i~0;~P_1_st~0 := 0; 7924#L294-2 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 7751#L299-1 assume 1 == ~C_1_i~0;~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 !(1 == ~P_1_pc~0); 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 !(0 != activate_threads_~tmp~1); 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 !(1 == ~P_2_pc~0); 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 !(0 != activate_threads_~tmp___0~1); 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 !(1 == ~C_1_pc~0); 7836#L257-2 assume !(2 == ~C_1_pc~0); 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 !(0 != activate_threads_~tmp___1~1); 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-18 13:52:51,922 INFO L796 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 !(0 == ~P_1_st~0); 8053#L321 assume !(0 == ~P_2_st~0); 8317#L325 assume !(0 == ~C_1_st~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 !(0 != eval_~tmp___2~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 1 == ~P_1_pc~0; 8292#L108-2 assume 1 == ~P_1_ev~0;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 0 != activate_threads_~tmp~1;~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 !(1 == ~P_2_pc~0); 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 0 != activate_threads_~tmp___0~1;~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 !(1 == ~C_1_pc~0); 8268#L257-8 assume !(2 == ~C_1_pc~0); 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 0 != activate_threads_~tmp___1~1;~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 0 == ~P_1_st~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 !(0 == start_simulation_~tmp~3); 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 0 == ~P_1_st~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 0 != stop_simulation_~tmp~2;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 !(0 != start_simulation_~tmp___0~2); 7920#L537-3 [2018-11-18 13:52:51,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:52:51,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1966545068, now seen corresponding path program 3 times [2018-11-18 13:52:51,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:52:51,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:52:51,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:51,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:52:51,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:51,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:52:51,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:52:51,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:52:51,934 INFO L82 PathProgramCache]: Analyzing trace with hash 782773852, now seen corresponding path program 1 times [2018-11-18 13:52:51,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:52:51,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:52:51,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:51,935 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:52:51,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:51,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:52:51,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:52:51,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:52:51,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:52:51,993 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:52:51,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:52:51,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:52:51,993 INFO L87 Difference]: Start difference. First operand 1073 states and 1447 transitions. cyclomatic complexity: 375 Second operand 5 states. [2018-11-18 13:52:52,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:52:52,055 INFO L93 Difference]: Finished difference Result 2385 states and 3214 transitions. [2018-11-18 13:52:52,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 13:52:52,056 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2385 states and 3214 transitions. [2018-11-18 13:52:52,063 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2352 [2018-11-18 13:52:52,069 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2385 states to 2385 states and 3214 transitions. [2018-11-18 13:52:52,069 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2385 [2018-11-18 13:52:52,071 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2385 [2018-11-18 13:52:52,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2385 states and 3214 transitions. [2018-11-18 13:52:52,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:52:52,074 INFO L705 BuchiCegarLoop]: Abstraction has 2385 states and 3214 transitions. [2018-11-18 13:52:52,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2385 states and 3214 transitions. [2018-11-18 13:52:52,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2385 to 1109. [2018-11-18 13:52:52,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1109 states. [2018-11-18 13:52:52,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1474 transitions. [2018-11-18 13:52:52,091 INFO L728 BuchiCegarLoop]: Abstraction has 1109 states and 1474 transitions. [2018-11-18 13:52:52,091 INFO L608 BuchiCegarLoop]: Abstraction has 1109 states and 1474 transitions. [2018-11-18 13:52:52,091 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-18 13:52:52,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1109 states and 1474 transitions. [2018-11-18 13:52:52,094 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1076 [2018-11-18 13:52:52,094 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:52:52,095 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:52:52,095 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-18 13:52:52,095 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-18 13:52:52,096 INFO L794 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 1 == ~P_1_i~0;~P_1_st~0 := 0; 11392#L294-2 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 11223#L299-1 assume 1 == ~C_1_i~0;~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 !(1 == ~P_1_pc~0); 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 !(0 != activate_threads_~tmp~1); 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 !(1 == ~P_2_pc~0); 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 !(0 != activate_threads_~tmp___0~1); 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 !(1 == ~C_1_pc~0); 11303#L257-2 assume !(2 == ~C_1_pc~0); 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 !(0 != activate_threads_~tmp___1~1); 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-18 13:52:52,096 INFO L796 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 !(0 == ~P_1_st~0); 11624#L321 assume !(0 == ~P_2_st~0); 11621#L325 assume !(0 == ~C_1_st~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 !(0 != eval_~tmp___2~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 1 == ~P_1_pc~0; 11601#L108-2 assume 1 == ~P_1_ev~0;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 0 != activate_threads_~tmp~1;~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 !(1 == ~P_2_pc~0); 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 !(0 != activate_threads_~tmp___0~1); 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 !(1 == ~C_1_pc~0); 11561#L257-8 assume !(2 == ~C_1_pc~0); 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 0 != activate_threads_~tmp___1~1;~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 0 == ~P_1_st~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 !(0 == start_simulation_~tmp~3); 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 0 == ~P_1_st~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 0 != stop_simulation_~tmp~2;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 !(0 != start_simulation_~tmp___0~2); 11385#L537-3 [2018-11-18 13:52:52,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:52:52,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1966545068, now seen corresponding path program 4 times [2018-11-18 13:52:52,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:52:52,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:52:52,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:52,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:52:52,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:52,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:52:52,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:52:52,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:52:52,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1001628570, now seen corresponding path program 1 times [2018-11-18 13:52:52,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:52:52,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:52:52,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:52,110 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:52:52,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:52,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:52:52,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:52:52,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:52:52,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:52:52,161 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:52:52,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:52:52,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:52:52,161 INFO L87 Difference]: Start difference. First operand 1109 states and 1474 transitions. cyclomatic complexity: 366 Second operand 5 states. [2018-11-18 13:52:52,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:52:52,225 INFO L93 Difference]: Finished difference Result 2355 states and 3131 transitions. [2018-11-18 13:52:52,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 13:52:52,226 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2355 states and 3131 transitions. [2018-11-18 13:52:52,250 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2322 [2018-11-18 13:52:52,254 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2355 states to 2355 states and 3131 transitions. [2018-11-18 13:52:52,255 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2355 [2018-11-18 13:52:52,256 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2355 [2018-11-18 13:52:52,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2355 states and 3131 transitions. [2018-11-18 13:52:52,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:52:52,258 INFO L705 BuchiCegarLoop]: Abstraction has 2355 states and 3131 transitions. [2018-11-18 13:52:52,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2355 states and 3131 transitions. [2018-11-18 13:52:52,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2355 to 1139. [2018-11-18 13:52:52,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1139 states. [2018-11-18 13:52:52,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1493 transitions. [2018-11-18 13:52:52,272 INFO L728 BuchiCegarLoop]: Abstraction has 1139 states and 1493 transitions. [2018-11-18 13:52:52,272 INFO L608 BuchiCegarLoop]: Abstraction has 1139 states and 1493 transitions. [2018-11-18 13:52:52,272 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-18 13:52:52,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1139 states and 1493 transitions. [2018-11-18 13:52:52,275 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1106 [2018-11-18 13:52:52,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:52:52,275 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:52:52,276 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-18 13:52:52,276 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-18 13:52:52,276 INFO L794 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 1 == ~P_1_i~0;~P_1_st~0 := 0; 14870#L294-2 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 14702#L299-1 assume 1 == ~C_1_i~0;~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 !(1 == ~P_1_pc~0); 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 !(0 != activate_threads_~tmp~1); 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 !(1 == ~P_2_pc~0); 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 !(0 != activate_threads_~tmp___0~1); 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 !(1 == ~C_1_pc~0); 14783#L257-2 assume !(2 == ~C_1_pc~0); 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 !(0 != activate_threads_~tmp___1~1); 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-18 13:52:52,276 INFO L796 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 !(0 == ~P_1_st~0); 15102#L321 assume !(0 == ~P_2_st~0); 15683#L325 assume !(0 == ~C_1_st~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 !(0 != eval_~tmp___2~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 1 == ~P_1_pc~0; 15214#L108-2 assume 1 == ~P_1_ev~0;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 0 != activate_threads_~tmp~1;~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 !(1 == ~P_2_pc~0); 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 !(0 != activate_threads_~tmp___0~1); 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 !(1 == ~C_1_pc~0); 15155#L257-8 assume !(2 == ~C_1_pc~0); 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 !(0 != activate_threads_~tmp___1~1); 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 0 == ~P_1_st~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 !(0 == start_simulation_~tmp~3); 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 0 == ~P_1_st~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 0 != stop_simulation_~tmp~2;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 !(0 != start_simulation_~tmp___0~2); 14865#L537-3 [2018-11-18 13:52:52,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:52:52,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1966545068, now seen corresponding path program 5 times [2018-11-18 13:52:52,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:52:52,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:52:52,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:52,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:52:52,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:52,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:52:52,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:52:52,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:52:52,291 INFO L82 PathProgramCache]: Analyzing trace with hash -278235108, now seen corresponding path program 1 times [2018-11-18 13:52:52,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:52:52,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:52:52,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:52,293 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:52:52,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:52,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:52:52,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:52:52,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:52:52,303 INFO L82 PathProgramCache]: Analyzing trace with hash 987398161, now seen corresponding path program 1 times [2018-11-18 13:52:52,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:52:52,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:52:52,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:52,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:52:52,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:52,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:52:52,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:52:52,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:52:52,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:52:52,471 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2018-11-18 13:52:52,522 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:52:52,523 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:52:52,523 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:52:52,523 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:52:52,523 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 13:52:52,523 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:52:52,523 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:52:52,523 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:52:52,524 INFO L131 ssoRankerPreferences]: Filename of dumped script: kundu2_false-unreach-call_false-termination.cil.c_Iteration10_Loop [2018-11-18 13:52:52,524 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:52:52,524 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:52:52,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:52,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:52,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:52,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:52,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:52,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:52,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:52,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:52,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:52,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:52,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:52,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:52,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:52,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:52,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:52,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:52,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:52,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:52,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:52,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:52,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:52,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:52,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:52,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:52,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:52,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:52,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:52,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:52,777 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:52:52,777 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6d7bd90f-0818-41e1-9736-40ecb781fa9a/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:52:52,793 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:52:52,793 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:52:52,800 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:52:52,800 INFO L448 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_6d7bd90f-0818-41e1-9736-40ecb781fa9a/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:52:52,837 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:52:52,837 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:52:52,840 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:52:52,840 INFO L448 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_6d7bd90f-0818-41e1-9736-40ecb781fa9a/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:52:52,865 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:52:52,865 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:52:52,870 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:52:52,870 INFO L448 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_6d7bd90f-0818-41e1-9736-40ecb781fa9a/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:52:52,905 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:52:52,905 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:52:52,907 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:52:52,908 INFO L448 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_6d7bd90f-0818-41e1-9736-40ecb781fa9a/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-18 13:52:52,952 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:52:52,953 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:52:52,968 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:52:52,968 INFO L448 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_6d7bd90f-0818-41e1-9736-40ecb781fa9a/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:52:52,986 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:52:52,986 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:52:52,992 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:52:52,992 INFO L448 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_6d7bd90f-0818-41e1-9736-40ecb781fa9a/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:52:53,009 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:52:53,009 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:52:53,015 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:52:53,015 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~P_2_pc~0=4} Honda state: {~P_2_pc~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6d7bd90f-0818-41e1-9736-40ecb781fa9a/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:52:53,034 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:52:53,034 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:52:53,036 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:52:53,036 INFO L448 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_6d7bd90f-0818-41e1-9736-40ecb781fa9a/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:52:53,052 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:52:53,052 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:52:53,055 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:52:53,055 INFO L448 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_6d7bd90f-0818-41e1-9736-40ecb781fa9a/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:52:53,072 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:52:53,072 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:52:53,075 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:52:53,075 INFO L448 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_6d7bd90f-0818-41e1-9736-40ecb781fa9a/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:52:53,100 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:52:53,100 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:52:53,102 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:52:53,102 INFO L448 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_6d7bd90f-0818-41e1-9736-40ecb781fa9a/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:52:53,129 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:52:53,129 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:52:53,131 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:52:53,131 INFO L448 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_6d7bd90f-0818-41e1-9736-40ecb781fa9a/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:52:53,149 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:52:53,149 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:52:53,152 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:52:53,152 INFO L448 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_6d7bd90f-0818-41e1-9736-40ecb781fa9a/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:52:53,176 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:52:53,176 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:52:53,178 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:52:53,178 INFO L448 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_6d7bd90f-0818-41e1-9736-40ecb781fa9a/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:52:53,202 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:52:53,202 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:52:53,208 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:52:53,208 INFO L448 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_6d7bd90f-0818-41e1-9736-40ecb781fa9a/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:52:53,228 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:52:53,228 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6d7bd90f-0818-41e1-9736-40ecb781fa9a/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:52:53,246 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 13:52:53,247 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:52:53,270 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 13:52:53,271 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:52:53,272 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:52:53,272 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:52:53,272 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:52:53,272 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:52:53,272 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:52:53,272 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:52:53,272 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:52:53,272 INFO L131 ssoRankerPreferences]: Filename of dumped script: kundu2_false-unreach-call_false-termination.cil.c_Iteration10_Loop [2018-11-18 13:52:53,272 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:52:53,272 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:52:53,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:53,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:53,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:53,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:53,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:53,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:53,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:53,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:53,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:53,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:53,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:53,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:53,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:53,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:53,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:53,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:53,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:53,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:53,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:53,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:53,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:53,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:53,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:53,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:53,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:53,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:53,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:53,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:52:53,536 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:52:53,541 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:52:53,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-18 13:52:53,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,544 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:52:53,546 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:52:53,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,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-18 13:52:53,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,549 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:52:53,550 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:52:53,550 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:52:53,556 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:52:53,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,557 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,558 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:52:53,559 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:52:53,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,562 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:52:53,563 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:52:53,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:52:53,565 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:52:53,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,566 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,566 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:52:53,567 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:52:53,567 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,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-18 13:52:53,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,571 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 13:52:53,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:52:53,571 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:53,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:52:53,574 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:52:53,574 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,575 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,575 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:52:53,579 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:52:53,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,580 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,581 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:52:53,581 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:52:53,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:52:53,583 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:52:53,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,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-18 13:52:53,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:52:53,588 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:52:53,588 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,589 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,590 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:52:53,590 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:52:53,590 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,594 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 13:52:53,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:52:53,595 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:53,595 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,596 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,597 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,597 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 13:52:53,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:52:53,597 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:53,598 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,610 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,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-18 13:52:53,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,611 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:52:53,612 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:52:53,612 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,614 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:52:53,615 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:52:53,615 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,616 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,617 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 13:52:53,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:52:53,618 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:53,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,621 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 13:52:53,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:52:53,622 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:53,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,623 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,624 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:52:53,625 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:52:53,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,626 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,627 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:52:53,628 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:52:53,628 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:52:53,631 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:52:53,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,632 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,633 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:52:53,633 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:52:53,633 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,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-18 13:52:53,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,635 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,636 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:52:53,636 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:52:53,636 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,640 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:52:53,641 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:52:53,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,642 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:52:53,644 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:52:53,644 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,645 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:52:53,647 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:52:53,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,648 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-18 13:52:53,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,649 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:53,649 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:52:53,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,651 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:53,652 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:52:53,652 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,655 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,656 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,656 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:53,657 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:52:53,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,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-18 13:52:53,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,659 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:53,660 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:52:53,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,662 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:53,662 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:52:53,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,665 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:53,665 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:52:53,665 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,666 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,667 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,667 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:53,668 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:52:53,668 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,669 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,669 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,670 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 13:52:53,670 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:53,670 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:52:53,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,672 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,672 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,673 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:53,673 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:52:53,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,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-18 13:52:53,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,675 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,675 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:53,675 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:52:53,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,677 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,677 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:53,678 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:52:53,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,679 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,680 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:53,680 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:52:53,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,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-18 13:52:53,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,682 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:53,682 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:52:53,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,685 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:53,685 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:52:53,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,689 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,690 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 13:52:53,690 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:53,690 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:52:53,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,692 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,693 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 13:52:53,693 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:53,693 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:52:53,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,698 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:53,699 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:52:53,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,705 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:53,706 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:52:53,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,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-18 13:52:53,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,708 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 13:52:53,708 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:53,709 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:52:53,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,711 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 13:52:53,711 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:53,712 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:52:53,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,714 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:53,715 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:52:53,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,718 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:53,719 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:52:53,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,723 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:53,723 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:52:53,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,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-18 13:52:53,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,726 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:53,726 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:52:53,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,729 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:53,730 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:52:53,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,739 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:53,740 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:52:53,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,743 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:53,743 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:52:53,749 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,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-18 13:52:53,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,752 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,752 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:53,752 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:52:53,752 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,753 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-18 13:52:53,754 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,755 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:53,755 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:53,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,765 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:53,766 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:53,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,771 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:53,772 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:53,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,775 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:53,775 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:53,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,777 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:53,778 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:53,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,779 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,782 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:53,782 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:53,782 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,784 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,785 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:53,785 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:53,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,787 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,787 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 13:52:53,787 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:53,788 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 13:52:53,788 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,790 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,790 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,791 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:53,791 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:53,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,794 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,795 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:53,795 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:53,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,797 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,797 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:53,797 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:53,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,798 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,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-18 13:52:53,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,799 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:53,800 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:53,800 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,801 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,802 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:53,802 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:53,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,803 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,805 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:53,805 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:53,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,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-18 13:52:53,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,807 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 13:52:53,807 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:53,808 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 13:52:53,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,809 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,809 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,810 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 13:52:53,810 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:53,811 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 13:52:53,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,815 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:53,816 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:53,816 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,818 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,818 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:53,819 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:53,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,821 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 13:52:53,821 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:53,822 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 13:52:53,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,824 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 13:52:53,824 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:53,825 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 13:52:53,825 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,827 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:53,827 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:53,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,830 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:53,830 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:53,830 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,832 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,833 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,833 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:53,834 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:53,834 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,835 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,836 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:53,837 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:53,837 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,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-18 13:52:53,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,840 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:53,841 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:53,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,844 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,845 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,845 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:53,846 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:53,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,849 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:53,850 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:53,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,853 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:53,853 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:53,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,855 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-18 13:52:53,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,856 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:53,856 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:52:53,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,857 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,858 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:53,859 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:52:53,859 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,863 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,864 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:53,865 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:52:53,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,867 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,867 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,868 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:53,868 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:52:53,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,870 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,896 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:53,897 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:52:53,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,898 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,899 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:53,899 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:52:53,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,901 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,901 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:53,902 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:52:53,902 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,903 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,905 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,905 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 13:52:53,905 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:53,906 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 13:52:53,906 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,908 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,908 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:53,908 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:52:53,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,909 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,910 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:53,911 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:52:53,911 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,913 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,913 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,913 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:53,913 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:52:53,913 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,915 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:53,915 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:52:53,915 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,917 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,918 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:53,918 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:52:53,918 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,920 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,921 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:53,921 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:52:53,921 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,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-18 13:52:53,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,923 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 13:52:53,923 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:53,924 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 13:52:53,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,925 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,925 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,926 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 13:52:53,926 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:53,926 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 13:52:53,926 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,937 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:53,938 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:52:53,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,940 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,941 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,941 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:53,941 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:52:53,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,943 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,943 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 13:52:53,944 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:53,944 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 13:52:53,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,946 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 13:52:53,946 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:53,947 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 13:52:53,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,951 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,951 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,952 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,952 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:53,953 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:52:53,953 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,954 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,954 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,955 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,955 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:53,958 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:52:53,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,960 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,960 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,961 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,961 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:53,961 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:52:53,961 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,962 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,962 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,963 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,963 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:53,966 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:52:53,966 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,968 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,968 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,969 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,969 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:53,969 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:52:53,969 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,975 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,975 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,976 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:53,976 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:52:53,976 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,978 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,978 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,979 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,979 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:53,981 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:52:53,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:52:53,984 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,985 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:53,985 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:52:53,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,986 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-18 13:52:53,986 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,987 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:53,987 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:53,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,987 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:53,988 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:52:53,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:53,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:53,990 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:53,990 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:53,990 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:53,990 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:53,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:53,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:53,991 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:53,991 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:52:53,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,002 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,002 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,002 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,002 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:54,003 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:52:54,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,004 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,005 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,005 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,005 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:54,006 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:52:54,006 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,007 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,008 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,008 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,008 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,008 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:54,009 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:52:54,009 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,010 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,010 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,010 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,011 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,011 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:54,012 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:52:54,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,013 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,014 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,014 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,014 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,015 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:54,015 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:52:54,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,017 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,017 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,017 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,017 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 13:52:54,017 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:54,018 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:52:54,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,026 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,026 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,026 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:54,027 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:52:54,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,037 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,037 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,038 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:54,038 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:52:54,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,039 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,039 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,040 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,040 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,040 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:54,041 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:52:54,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,042 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,042 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,042 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,043 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:54,043 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:52:54,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,044 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,045 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,045 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,045 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:54,045 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:52:54,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,047 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,047 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,048 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:54,049 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:52:54,049 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,050 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,050 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,050 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,050 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,051 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 13:52:54,051 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:54,051 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:52:54,051 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,058 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,059 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,059 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,059 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,059 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 13:52:54,059 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:54,060 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:52:54,060 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,067 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,068 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,068 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,068 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:54,069 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:52:54,069 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,071 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,071 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,071 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,073 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:54,073 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:52:54,073 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,075 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,075 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,075 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,075 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,075 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 13:52:54,076 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:54,076 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:52:54,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,080 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,080 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,080 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,080 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,080 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 13:52:54,080 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:54,081 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:52:54,081 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,086 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,086 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,086 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,086 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:54,087 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:52:54,087 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,089 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,089 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,089 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,089 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:54,090 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:52:54,090 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,093 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,094 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,094 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,094 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:54,094 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:52:54,094 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,096 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,097 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,097 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,097 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:54,097 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:52:54,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,100 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,110 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,110 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,111 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:54,111 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:52:54,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,117 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,117 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,118 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:54,118 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:52:54,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,122 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,122 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,122 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,122 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,123 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:54,124 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:52:54,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,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-18 13:52:54,133 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,133 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,133 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 13:52:54,133 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 13:52:54,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,135 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-18 13:52:54,135 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,135 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,135 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 13:52:54,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,136 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,136 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:54,137 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,138 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,139 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,139 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 13:52:54,139 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,139 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,140 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:54,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,158 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,158 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 13:52:54,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,158 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,159 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:54,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,161 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,162 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,162 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,162 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 13:52:54,162 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,163 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,163 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:54,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,167 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,168 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,168 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 13:52:54,168 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,168 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,169 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:54,169 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,182 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,183 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 13:52:54,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,183 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,183 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:54,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,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-18 13:52:54,185 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,186 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 13:52:54,186 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,186 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,187 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:54,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,188 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,189 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,189 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 13:52:54,189 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,189 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 13:52:54,189 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,190 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 13:52:54,190 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,194 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,206 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,206 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 13:52:54,207 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,207 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,208 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:54,208 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,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-18 13:52:54,210 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,210 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 13:52:54,210 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,210 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,211 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:54,211 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,214 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,214 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 13:52:54,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,215 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,215 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:54,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,234 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,234 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 13:52:54,234 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,234 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,235 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:54,235 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,236 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,237 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,237 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 13:52:54,237 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,237 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,238 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:54,238 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,239 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,240 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,240 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 13:52:54,240 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,241 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,241 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:54,241 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,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-18 13:52:54,260 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,260 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 13:52:54,260 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,260 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 13:52:54,260 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,261 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 13:52:54,261 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,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-18 13:52:54,267 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,267 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 13:52:54,267 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,267 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 13:52:54,267 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,270 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 13:52:54,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,282 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,282 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,282 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 13:52:54,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,283 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,284 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:54,284 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,286 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,287 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,287 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 13:52:54,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,287 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,288 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:54,288 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,289 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,290 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,290 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 13:52:54,290 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,290 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 13:52:54,290 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,291 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 13:52:54,297 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,302 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,302 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,302 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,302 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 13:52:54,303 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,303 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 13:52:54,303 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,304 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 13:52:54,304 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,307 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,312 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,313 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 13:52:54,313 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,313 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,314 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:54,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,316 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,317 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,317 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 13:52:54,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,317 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,318 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:54,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,322 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,322 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 13:52:54,322 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,323 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,323 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:54,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,325 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,338 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,338 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 13:52:54,338 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,338 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,339 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:54,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,342 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,342 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 13:52:54,342 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,343 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,344 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:54,344 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,349 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,350 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,350 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 13:52:54,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,350 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,351 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:54,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,356 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,365 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,365 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 13:52:54,365 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,365 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,366 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:54,366 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,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-18 13:52:54,369 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,369 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 13:52:54,370 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,370 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,370 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:54,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,372 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-18 13:52:54,372 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,372 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,373 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:54,373 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,373 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:54,374 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:52:54,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,392 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,392 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:54,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,393 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:54,394 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:52:54,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,413 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,414 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,414 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:54,414 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,414 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:54,417 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:52:54,418 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,419 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,420 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,420 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:54,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,420 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:54,421 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:52:54,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,422 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,422 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,422 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:54,423 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,423 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:54,424 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:52:54,424 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,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-18 13:52:54,426 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,426 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:54,426 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,426 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:54,427 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:52:54,427 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,428 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,429 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,429 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:54,429 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,429 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:54,430 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:52:54,430 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,431 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,450 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,450 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:54,450 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,451 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 13:52:54,451 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:54,452 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 13:52:54,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,458 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,458 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,459 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,459 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:54,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,460 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:54,460 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:52:54,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,462 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,462 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:54,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,462 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:54,463 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:52:54,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,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-18 13:52:54,478 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,478 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:54,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,478 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:54,479 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:52:54,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,481 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,481 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:54,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,481 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:54,482 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:52:54,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,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-18 13:52:54,484 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,484 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:54,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,484 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:54,485 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:52:54,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,504 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,505 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:54,505 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,505 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:54,506 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:52:54,506 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,508 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,508 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:54,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,508 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 13:52:54,508 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:54,509 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 13:52:54,509 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,519 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,519 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:54,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,519 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 13:52:54,519 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:54,521 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 13:52:54,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,534 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,534 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:54,534 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,534 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:54,536 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:52:54,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,538 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,538 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:54,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,538 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:54,539 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:52:54,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,541 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,541 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:54,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,541 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 13:52:54,541 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:54,543 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 13:52:54,543 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,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-18 13:52:54,562 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,562 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:54,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,562 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 13:52:54,562 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:54,564 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 13:52:54,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,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-18 13:52:54,570 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,571 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:54,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,571 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:54,572 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:52:54,573 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,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-18 13:52:54,575 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,575 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:54,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,575 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:54,576 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:52:54,576 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,580 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,591 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,591 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:54,592 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,592 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:54,593 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:52:54,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,594 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,595 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,595 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:54,595 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,595 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:54,597 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:52:54,598 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,602 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,604 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,604 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:54,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,605 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:54,606 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:52:54,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,621 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,621 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:54,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,622 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:54,622 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:52:54,623 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,627 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,628 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,628 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:54,628 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,629 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:54,630 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:52:54,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,634 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,634 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,635 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,635 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:54,635 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,635 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 13:52:54,637 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 13:52:54,637 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,638 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-18 13:52:54,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,650 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,650 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,651 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,651 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:54,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,653 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,653 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,654 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,654 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:54,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,662 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,662 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,663 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,663 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:54,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,666 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,679 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,679 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,680 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,680 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:54,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,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-18 13:52:54,682 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,682 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,683 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,683 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:54,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,685 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,685 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,686 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,686 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:54,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,709 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,709 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,710 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,710 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:54,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,712 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,712 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,713 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 13:52:54,713 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,713 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 13:52:54,713 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,716 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,716 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,717 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,717 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:54,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,744 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,744 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,744 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,745 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:54,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,747 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,747 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,747 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,748 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,748 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:54,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,750 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,750 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,751 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,751 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:54,752 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,776 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,777 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,777 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,777 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:54,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,780 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,780 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,781 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,781 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,781 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:54,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,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-18 13:52:54,784 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,784 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,784 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,784 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 13:52:54,784 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,785 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 13:52:54,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,787 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,808 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,808 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,808 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,809 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 13:52:54,809 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,809 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 13:52:54,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,820 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,820 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,820 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,821 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:54,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,824 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,825 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,825 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,825 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,826 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:54,826 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,828 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,839 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,839 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,840 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 13:52:54,840 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,840 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 13:52:54,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,844 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,844 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,844 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 13:52:54,844 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,845 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 13:52:54,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,849 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,849 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,850 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,850 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:54,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,873 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,873 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,873 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,873 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,873 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:54,874 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,877 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,877 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,877 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,878 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,878 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:54,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,880 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,880 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,880 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,881 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,881 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:54,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,883 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,904 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,904 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,904 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,904 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,905 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:54,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,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-18 13:52:54,911 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,911 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,911 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,913 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,913 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:54,913 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,916 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,917 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,917 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,917 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,918 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:54,918 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,923 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,934 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,935 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 13:52:54,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,935 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 13:52:54,935 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:52:54,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,938 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-18 13:52:54,939 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,939 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,939 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:54,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,939 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 13:52:54,940 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:52:54,940 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,943 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,943 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:54,943 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,943 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 13:52:54,944 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:52:54,944 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,962 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,963 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,965 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,965 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:54,965 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,965 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 13:52:54,966 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:52:54,966 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,975 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,976 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,976 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:54,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,976 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 13:52:54,977 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:52:54,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,979 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,980 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,980 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:54,980 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,980 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 13:52:54,981 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:52:54,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:54,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:54,983 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:54,998 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:54,998 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:54,999 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:54,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:54,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:54,999 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 13:52:54,999 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:52:54,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:55,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:55,002 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:55,002 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:55,002 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:55,002 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:55,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:55,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:55,006 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 13:52:55,007 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:52:55,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:55,009 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:55,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-18 13:52:55,010 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:55,010 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:55,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:55,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:55,010 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 13:52:55,010 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 13:52:55,011 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 13:52:55,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:55,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:55,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:55,031 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:55,031 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:55,031 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:55,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:55,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:55,032 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 13:52:55,032 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:52:55,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:55,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:55,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:55,035 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:55,036 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:55,036 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:55,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:55,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:55,036 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 13:52:55,037 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:52:55,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:55,039 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:55,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:55,040 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:55,040 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:55,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:55,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:55,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:55,041 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 13:52:55,041 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:52:55,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:55,045 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:55,045 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:55,067 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:55,067 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:55,067 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:55,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:55,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:55,067 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 13:52:55,068 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:52:55,068 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:55,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:55,071 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:55,072 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:55,072 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:55,072 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:55,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:55,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:55,073 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 13:52:55,073 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:52:55,073 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:55,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:55,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:55,076 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:55,076 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:55,076 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:55,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:55,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:55,077 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 13:52:55,077 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:52:55,077 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:55,080 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:55,081 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:55,100 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:55,100 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:55,100 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:55,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:55,100 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 13:52:55,100 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 13:52:55,101 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 13:52:55,101 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:55,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:55,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:55,108 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:55,108 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:55,108 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:55,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:55,108 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 13:52:55,108 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 13:52:55,109 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 13:52:55,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:55,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:55,129 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:55,129 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:55,130 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:55,130 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:55,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:55,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:55,130 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 13:52:55,131 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:52:55,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:55,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:55,136 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:55,136 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:55,136 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:55,137 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:55,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:55,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:55,137 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 13:52:55,137 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:52:55,137 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:55,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:55,143 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:55,143 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:55,143 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:55,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:55,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:55,144 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 13:52:55,144 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 13:52:55,144 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 13:52:55,144 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:55,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:55,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:55,148 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:55,148 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:55,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:55,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:55,149 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 13:52:55,149 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 13:52:55,149 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 13:52:55,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:55,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:55,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:55,168 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:55,169 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:55,169 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:55,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:55,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:55,169 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 13:52:55,170 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:52:55,170 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:55,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:55,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-18 13:52:55,175 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:55,175 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:55,175 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:55,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:55,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:55,176 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 13:52:55,176 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:52:55,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:55,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:55,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:55,179 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:55,179 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:55,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:55,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:55,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:55,179 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 13:52:55,180 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:52:55,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:55,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:55,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:55,201 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:55,201 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:55,201 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:55,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:55,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:55,202 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 13:52:55,202 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:52:55,202 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:55,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:55,205 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:55,206 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:55,206 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:55,206 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:55,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:55,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:55,206 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 13:52:55,207 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:52:55,207 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:55,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:55,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:55,220 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:55,220 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:55,220 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:55,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:55,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:55,220 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 13:52:55,221 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:52:55,221 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:55,227 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:55,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-18 13:52:55,237 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:55,237 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:55,237 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:55,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:55,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:55,238 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 13:52:55,238 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:52:55,238 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:55,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:55,242 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:52:55,243 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 13:52:55,243 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 13:52:55,243 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:52:55,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:52:55,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:52:55,243 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 13:52:55,243 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:52:55,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:52:55,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:52:55,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:52:55,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:52:55,246 INFO L87 Difference]: Start difference. First operand 1139 states and 1493 transitions. cyclomatic complexity: 355 Second operand 3 states. [2018-11-18 13:52:55,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:52:55,541 INFO L93 Difference]: Finished difference Result 1139 states and 1477 transitions. [2018-11-18 13:52:55,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:52:55,541 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1139 states and 1477 transitions. [2018-11-18 13:52:55,548 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1106 [2018-11-18 13:52:55,552 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1139 states to 1139 states and 1477 transitions. [2018-11-18 13:52:55,553 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1139 [2018-11-18 13:52:55,553 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1139 [2018-11-18 13:52:55,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1139 states and 1477 transitions. [2018-11-18 13:52:55,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:52:55,555 INFO L705 BuchiCegarLoop]: Abstraction has 1139 states and 1477 transitions. [2018-11-18 13:52:55,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states and 1477 transitions. [2018-11-18 13:52:55,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1139. [2018-11-18 13:52:55,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1139 states. [2018-11-18 13:52:55,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1477 transitions. [2018-11-18 13:52:55,576 INFO L728 BuchiCegarLoop]: Abstraction has 1139 states and 1477 transitions. [2018-11-18 13:52:55,576 INFO L608 BuchiCegarLoop]: Abstraction has 1139 states and 1477 transitions. [2018-11-18 13:52:55,576 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-18 13:52:55,576 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1139 states and 1477 transitions. [2018-11-18 13:52:55,580 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1106 [2018-11-18 13:52:55,580 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:52:55,580 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:52:55,581 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-18 13:52:55,581 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-18 13:52:55,581 INFO L794 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 1 == ~P_1_i~0;~P_1_st~0 := 0; 17157#L294-2 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 16989#L299-1 assume 1 == ~C_1_i~0;~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 !(1 == ~P_1_pc~0); 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 !(0 != activate_threads_~tmp~1); 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 !(1 == ~P_2_pc~0); 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 !(0 != activate_threads_~tmp___0~1); 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 !(1 == ~C_1_pc~0); 17071#L257-2 assume !(2 == ~C_1_pc~0); 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 !(0 != activate_threads_~tmp___1~1); 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-18 13:52:55,581 INFO L796 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 0 == ~P_1_st~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 0 != eval_~tmp___2~0; 17032#L351-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 17163#L360 assume 0 != eval_~tmp~0;~P_1_st~0 := 1;assume { :begin_inline_P_1 } true; 17085#L72 assume 0 == ~P_1_pc~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 !(0 == ~P_2_st~0); 17053#L371 assume !(0 == ~C_1_st~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 !(0 == ~P_1_st~0); 17840#L321 assume !(0 == ~P_2_st~0); 17838#L325 assume !(0 == ~C_1_st~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 !(0 != eval_~tmp___2~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 1 == ~P_1_pc~0; 17092#L108-2 assume 1 == ~P_1_ev~0;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 0 != activate_threads_~tmp~1;~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 !(1 == ~P_2_pc~0); 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 !(0 != activate_threads_~tmp___0~1); 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 !(1 == ~C_1_pc~0); 17942#L257-8 assume !(2 == ~C_1_pc~0); 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 !(0 != activate_threads_~tmp___1~1); 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 0 == ~P_1_st~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 !(0 == start_simulation_~tmp~3); 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 0 == ~P_1_st~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 0 != stop_simulation_~tmp~2;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 !(0 != start_simulation_~tmp___0~2); 17155#L537-3 [2018-11-18 13:52:55,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:52:55,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1966545068, now seen corresponding path program 6 times [2018-11-18 13:52:55,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:52:55,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:52:55,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:55,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:52:55,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:55,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:52:55,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:52:55,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:52:55,598 INFO L82 PathProgramCache]: Analyzing trace with hash 194105802, now seen corresponding path program 1 times [2018-11-18 13:52:55,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:52:55,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:52:55,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:55,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:52:55,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:55,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:52:55,690 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-18 13:52:55,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:52:55,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:52:55,691 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:52:55,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:52:55,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:52:55,691 INFO L87 Difference]: Start difference. First operand 1139 states and 1477 transitions. cyclomatic complexity: 339 Second operand 3 states. [2018-11-18 13:52:55,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:52:55,821 INFO L93 Difference]: Finished difference Result 1908 states and 2457 transitions. [2018-11-18 13:52:55,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:52:55,833 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1908 states and 2457 transitions. [2018-11-18 13:52:55,840 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1864 [2018-11-18 13:52:55,844 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1908 states to 1908 states and 2457 transitions. [2018-11-18 13:52:55,845 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1908 [2018-11-18 13:52:55,846 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1908 [2018-11-18 13:52:55,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1908 states and 2457 transitions. [2018-11-18 13:52:55,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:52:55,850 INFO L705 BuchiCegarLoop]: Abstraction has 1908 states and 2457 transitions. [2018-11-18 13:52:55,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1908 states and 2457 transitions. [2018-11-18 13:52:55,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1908 to 1892. [2018-11-18 13:52:55,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1892 states. [2018-11-18 13:52:55,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1892 states and 2437 transitions. [2018-11-18 13:52:55,880 INFO L728 BuchiCegarLoop]: Abstraction has 1892 states and 2437 transitions. [2018-11-18 13:52:55,880 INFO L608 BuchiCegarLoop]: Abstraction has 1892 states and 2437 transitions. [2018-11-18 13:52:55,880 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-18 13:52:55,881 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1892 states and 2437 transitions. [2018-11-18 13:52:55,886 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1848 [2018-11-18 13:52:55,886 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:52:55,887 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:52:55,887 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-18 13:52:55,887 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:52:55,887 INFO L794 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 1 == ~P_1_i~0;~P_1_st~0 := 0; 20204#L294-2 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 20040#L299-1 assume 1 == ~C_1_i~0;~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 !(1 == ~P_1_pc~0); 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 !(0 != activate_threads_~tmp~1); 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 !(1 == ~P_2_pc~0); 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 !(0 != activate_threads_~tmp___0~1); 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 !(1 == ~C_1_pc~0); 20116#L257-2 assume !(2 == ~C_1_pc~0); 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 !(0 != activate_threads_~tmp___1~1); 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-18 13:52:55,888 INFO L796 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 0 == ~P_1_st~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 0 != eval_~tmp___2~0; 20248#L351-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 20244#L360 assume !(0 != eval_~tmp~0); 20245#L356 assume !(0 == ~P_2_st~0); 21475#L371 assume !(0 == ~C_1_st~0); 21472#L386 [2018-11-18 13:52:55,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:52:55,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1990317737, now seen corresponding path program 1 times [2018-11-18 13:52:55,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:52:55,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:52:55,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:55,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:52:55,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:55,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:52:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:52:55,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:52:55,899 INFO L82 PathProgramCache]: Analyzing trace with hash 2000037912, now seen corresponding path program 1 times [2018-11-18 13:52:55,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:52:55,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:52:55,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:55,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:52:55,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:55,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:52:55,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:52:55,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:52:55,903 INFO L82 PathProgramCache]: Analyzing trace with hash -825812880, now seen corresponding path program 1 times [2018-11-18 13:52:55,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:52:55,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:52:55,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:55,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:52:55,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:55,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:52:55,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:52:55,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:52:55,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:52:55,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:52:55,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:52:55,974 INFO L87 Difference]: Start difference. First operand 1892 states and 2437 transitions. cyclomatic complexity: 548 Second operand 3 states. [2018-11-18 13:52:56,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:52:56,012 INFO L93 Difference]: Finished difference Result 3049 states and 3877 transitions. [2018-11-18 13:52:56,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:52:56,015 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3049 states and 3877 transitions. [2018-11-18 13:52:56,033 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2967 [2018-11-18 13:52:56,045 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3049 states to 3049 states and 3877 transitions. [2018-11-18 13:52:56,045 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3049 [2018-11-18 13:52:56,047 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3049 [2018-11-18 13:52:56,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3049 states and 3877 transitions. [2018-11-18 13:52:56,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:52:56,051 INFO L705 BuchiCegarLoop]: Abstraction has 3049 states and 3877 transitions. [2018-11-18 13:52:56,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3049 states and 3877 transitions. [2018-11-18 13:52:56,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3049 to 2949. [2018-11-18 13:52:56,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2949 states. [2018-11-18 13:52:56,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2949 states and 3757 transitions. [2018-11-18 13:52:56,094 INFO L728 BuchiCegarLoop]: Abstraction has 2949 states and 3757 transitions. [2018-11-18 13:52:56,094 INFO L608 BuchiCegarLoop]: Abstraction has 2949 states and 3757 transitions. [2018-11-18 13:52:56,094 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-18 13:52:56,094 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2949 states and 3757 transitions. [2018-11-18 13:52:56,103 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2867 [2018-11-18 13:52:56,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:52:56,103 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:52:56,104 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-18 13:52:56,104 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:52:56,104 INFO L794 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 1 == ~P_1_i~0;~P_1_st~0 := 0; 25172#L294-2 assume !(1 == ~P_2_i~0);~P_2_st~0 := 2; 24986#L299-1 assume 1 == ~C_1_i~0;~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 !(1 == ~P_1_pc~0); 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 !(0 != activate_threads_~tmp~1); 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 !(1 == ~P_2_pc~0); 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 !(0 != activate_threads_~tmp___0~1); 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 !(1 == ~C_1_pc~0); 25077#L257-2 assume !(2 == ~C_1_pc~0); 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 !(0 != activate_threads_~tmp___1~1); 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-18 13:52:56,104 INFO L796 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 0 == ~P_1_st~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 0 != eval_~tmp___2~0; 25804#L351-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 25801#L360 assume !(0 != eval_~tmp~0); 25802#L356 assume !(0 == ~P_2_st~0); 26596#L371 assume !(0 == ~C_1_st~0); 26594#L386 [2018-11-18 13:52:56,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:52:56,105 INFO L82 PathProgramCache]: Analyzing trace with hash -381421525, now seen corresponding path program 1 times [2018-11-18 13:52:56,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:52:56,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:52:56,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:56,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:52:56,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:56,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:52:56,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:52:56,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:52:56,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:52:56,130 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:52:56,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:52:56,130 INFO L82 PathProgramCache]: Analyzing trace with hash 2000037912, now seen corresponding path program 2 times [2018-11-18 13:52:56,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:52:56,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:52:56,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:56,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:52:56,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:56,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:52:56,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:52:56,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:52:56,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:52:56,259 INFO L87 Difference]: Start difference. First operand 2949 states and 3757 transitions. cyclomatic complexity: 811 Second operand 3 states. [2018-11-18 13:52:56,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:52:56,277 INFO L93 Difference]: Finished difference Result 2923 states and 3730 transitions. [2018-11-18 13:52:56,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:52:56,284 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2923 states and 3730 transitions. [2018-11-18 13:52:56,290 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2867 [2018-11-18 13:52:56,297 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2923 states to 2923 states and 3730 transitions. [2018-11-18 13:52:56,298 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2923 [2018-11-18 13:52:56,299 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2923 [2018-11-18 13:52:56,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2923 states and 3730 transitions. [2018-11-18 13:52:56,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:52:56,301 INFO L705 BuchiCegarLoop]: Abstraction has 2923 states and 3730 transitions. [2018-11-18 13:52:56,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2923 states and 3730 transitions. [2018-11-18 13:52:56,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2923 to 2923. [2018-11-18 13:52:56,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2923 states. [2018-11-18 13:52:56,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2923 states to 2923 states and 3730 transitions. [2018-11-18 13:52:56,324 INFO L728 BuchiCegarLoop]: Abstraction has 2923 states and 3730 transitions. [2018-11-18 13:52:56,324 INFO L608 BuchiCegarLoop]: Abstraction has 2923 states and 3730 transitions. [2018-11-18 13:52:56,324 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-18 13:52:56,324 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2923 states and 3730 transitions. [2018-11-18 13:52:56,330 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2867 [2018-11-18 13:52:56,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:52:56,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:52:56,331 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-18 13:52:56,331 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:52:56,331 INFO L794 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 1 == ~P_1_i~0;~P_1_st~0 := 0; 31053#L294-2 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 30866#L299-1 assume 1 == ~C_1_i~0;~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 !(1 == ~P_1_pc~0); 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 !(0 != activate_threads_~tmp~1); 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 !(1 == ~P_2_pc~0); 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 !(0 != activate_threads_~tmp___0~1); 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 !(1 == ~C_1_pc~0); 30950#L257-2 assume !(2 == ~C_1_pc~0); 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 !(0 != activate_threads_~tmp___1~1); 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-18 13:52:56,331 INFO L796 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 0 == ~P_1_st~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 0 != eval_~tmp___2~0; 32461#L351-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 32459#L360 assume !(0 != eval_~tmp~0); 32115#L356 assume 0 == ~P_2_st~0;eval_~tmp___0~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 32112#L375 assume !(0 != eval_~tmp___0~0); 32113#L371 assume !(0 == ~C_1_st~0); 32475#L386 [2018-11-18 13:52:56,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:52:56,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1990317737, now seen corresponding path program 2 times [2018-11-18 13:52:56,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:52:56,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:52:56,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:56,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:52:56,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:56,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:52:56,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:52:56,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:52:56,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1871491567, now seen corresponding path program 1 times [2018-11-18 13:52:56,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:52:56,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:52:56,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:56,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:52:56,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:56,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:52:56,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:52:56,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:52:56,343 INFO L82 PathProgramCache]: Analyzing trace with hash 169462935, now seen corresponding path program 1 times [2018-11-18 13:52:56,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:52:56,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:52:56,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:56,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:52:56,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:56,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:52:56,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:52:56,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:52:56,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 13:52:56,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:52:56,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:52:56,410 INFO L87 Difference]: Start difference. First operand 2923 states and 3730 transitions. cyclomatic complexity: 810 Second operand 3 states. [2018-11-18 13:52:56,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:52:56,432 INFO L93 Difference]: Finished difference Result 4814 states and 6084 transitions. [2018-11-18 13:52:56,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:52:56,435 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4814 states and 6084 transitions. [2018-11-18 13:52:56,445 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 4734 [2018-11-18 13:52:56,456 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4814 states to 4814 states and 6084 transitions. [2018-11-18 13:52:56,457 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4814 [2018-11-18 13:52:56,459 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4814 [2018-11-18 13:52:56,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4814 states and 6084 transitions. [2018-11-18 13:52:56,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:52:56,463 INFO L705 BuchiCegarLoop]: Abstraction has 4814 states and 6084 transitions. [2018-11-18 13:52:56,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4814 states and 6084 transitions. [2018-11-18 13:52:56,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4814 to 4814. [2018-11-18 13:52:56,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4814 states. [2018-11-18 13:52:56,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4814 states to 4814 states and 6084 transitions. [2018-11-18 13:52:56,499 INFO L728 BuchiCegarLoop]: Abstraction has 4814 states and 6084 transitions. [2018-11-18 13:52:56,499 INFO L608 BuchiCegarLoop]: Abstraction has 4814 states and 6084 transitions. [2018-11-18 13:52:56,499 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-18 13:52:56,499 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4814 states and 6084 transitions. [2018-11-18 13:52:56,509 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 4734 [2018-11-18 13:52:56,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:52:56,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:52:56,509 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-18 13:52:56,509 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:52:56,510 INFO L794 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 1 == ~P_1_i~0;~P_1_st~0 := 0; 38797#L294-2 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 38610#L299-1 assume 1 == ~C_1_i~0;~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 !(1 == ~P_1_pc~0); 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 !(0 != activate_threads_~tmp~1); 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 !(1 == ~P_2_pc~0); 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 !(0 != activate_threads_~tmp___0~1); 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 !(1 == ~C_1_pc~0); 38691#L257-2 assume !(2 == ~C_1_pc~0); 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 !(0 != activate_threads_~tmp___1~1); 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-18 13:52:56,510 INFO L796 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 0 == ~P_1_st~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 0 != eval_~tmp___2~0; 40245#L351-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 40242#L360 assume !(0 != eval_~tmp~0); 40243#L356 assume 0 == ~P_2_st~0;eval_~tmp___0~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 40755#L375 assume !(0 != eval_~tmp___0~0); 40263#L371 assume 0 == ~C_1_st~0;eval_~tmp___1~0 := eval_#t~nondet4;havoc eval_#t~nondet4; 40259#L390 assume !(0 != eval_~tmp___1~0); 40257#L386 [2018-11-18 13:52:56,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:52:56,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1990317737, now seen corresponding path program 3 times [2018-11-18 13:52:56,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:52:56,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:52:56,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:56,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:52:56,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:56,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:52:56,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:52:56,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:52:56,518 INFO L82 PathProgramCache]: Analyzing trace with hash -2113305569, now seen corresponding path program 1 times [2018-11-18 13:52:56,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:52:56,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:52:56,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:56,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:52:56,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:56,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:52:56,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:52:56,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:52:56,522 INFO L82 PathProgramCache]: Analyzing trace with hash 958381687, now seen corresponding path program 1 times [2018-11-18 13:52:56,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:52:56,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:52:56,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:56,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:52:56,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:52:56,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:52:56,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:52:56,761 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 94 [2018-11-18 13:52:56,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 01:52:56 BoogieIcfgContainer [2018-11-18 13:52:56,848 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 13:52:56,849 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 13:52:56,849 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 13:52:56,849 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 13:52:56,849 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:52:50" (3/4) ... [2018-11-18 13:52:56,852 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-18 13:52:56,894 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6d7bd90f-0818-41e1-9736-40ecb781fa9a/bin-2019/uautomizer/witness.graphml [2018-11-18 13:52:56,894 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 13:52:56,895 INFO L168 Benchmark]: Toolchain (without parser) took 6966.75 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 331.9 MB). Free memory was 957.0 MB in the beginning and 1.1 GB in the end (delta: -129.2 MB). Peak memory consumption was 202.7 MB. Max. memory is 11.5 GB. [2018-11-18 13:52:56,895 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:52:56,895 INFO L168 Benchmark]: CACSL2BoogieTranslator took 205.68 ms. Allocated memory is still 1.0 GB. Free memory was 957.0 MB in the beginning and 940.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-18 13:52:56,895 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -196.3 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2018-11-18 13:52:56,896 INFO L168 Benchmark]: Boogie Preprocessor took 28.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-18 13:52:56,896 INFO L168 Benchmark]: RCFGBuilder took 481.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.5 MB). Peak memory consumption was 51.5 MB. Max. memory is 11.5 GB. [2018-11-18 13:52:56,896 INFO L168 Benchmark]: BuchiAutomizer took 6123.35 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 189.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -3.9 MB). Peak memory consumption was 185.4 MB. Max. memory is 11.5 GB. [2018-11-18 13:52:56,896 INFO L168 Benchmark]: Witness Printer took 45.20 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:52:56,898 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 205.68 ms. Allocated memory is still 1.0 GB. Free memory was 957.0 MB in the beginning and 940.9 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 79.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -196.3 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 481.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.5 MB). Peak memory consumption was 51.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6123.35 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 189.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -3.9 MB). Peak memory consumption was 185.4 MB. Max. memory is 11.5 GB. * Witness Printer took 45.20 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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.0s and 15 iterations. TraceHistogramMax:2. Analysis of lassos took 4.4s. 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: 4ms 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@578c319d=0, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@49e74bcc=0, C_1_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@354c40f9=0, data_0=0, kernel_st=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@11125f6a=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@3fbdf0b3=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@57a4d6e5=0, tmp=0, C_1_pr=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2b9097f4=0, P_1_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7a499577=0, P_2_ev=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@11e04a35=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...