./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_1_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_fd0ad6d6-6f45-4215-bfdb-dd254d79619d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fd0ad6d6-6f45-4215-bfdb-dd254d79619d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fd0ad6d6-6f45-4215-bfdb-dd254d79619d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fd0ad6d6-6f45-4215-bfdb-dd254d79619d/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_1_false-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_fd0ad6d6-6f45-4215-bfdb-dd254d79619d/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fd0ad6d6-6f45-4215-bfdb-dd254d79619d/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 375e158327910cae8c3594f7d2ad0376509a1ecb ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-635dfa2 [2018-12-01 15:16:04,786 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 15:16:04,787 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 15:16:04,793 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 15:16:04,793 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 15:16:04,793 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 15:16:04,794 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 15:16:04,795 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 15:16:04,795 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 15:16:04,796 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 15:16:04,796 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 15:16:04,796 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 15:16:04,797 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 15:16:04,797 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 15:16:04,798 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 15:16:04,798 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 15:16:04,799 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 15:16:04,800 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 15:16:04,800 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 15:16:04,801 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 15:16:04,802 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 15:16:04,802 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 15:16:04,803 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 15:16:04,804 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 15:16:04,804 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 15:16:04,804 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 15:16:04,805 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 15:16:04,805 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 15:16:04,805 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 15:16:04,806 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 15:16:04,806 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 15:16:04,806 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 15:16:04,807 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 15:16:04,807 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 15:16:04,807 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 15:16:04,807 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 15:16:04,808 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fd0ad6d6-6f45-4215-bfdb-dd254d79619d/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-01 15:16:04,815 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 15:16:04,815 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 15:16:04,816 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 15:16:04,816 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 15:16:04,816 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 15:16:04,816 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-01 15:16:04,816 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-01 15:16:04,817 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-01 15:16:04,817 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-01 15:16:04,817 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-01 15:16:04,817 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-01 15:16:04,817 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 15:16:04,817 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 15:16:04,817 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 15:16:04,817 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 15:16:04,817 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 15:16:04,817 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 15:16:04,817 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-01 15:16:04,818 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-01 15:16:04,818 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-01 15:16:04,818 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 15:16:04,818 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 15:16:04,818 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-01 15:16:04,818 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 15:16:04,818 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-01 15:16:04,818 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 15:16:04,818 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 15:16:04,818 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-01 15:16:04,818 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 15:16:04,819 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 15:16:04,819 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-01 15:16:04,819 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-01 15:16:04,819 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_fd0ad6d6-6f45-4215-bfdb-dd254d79619d/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 -> 375e158327910cae8c3594f7d2ad0376509a1ecb [2018-12-01 15:16:04,836 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 15:16:04,843 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 15:16:04,846 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 15:16:04,847 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 15:16:04,847 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 15:16:04,847 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fd0ad6d6-6f45-4215-bfdb-dd254d79619d/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/pc_sfifo_1_false-unreach-call_false-termination.cil.c [2018-12-01 15:16:04,885 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fd0ad6d6-6f45-4215-bfdb-dd254d79619d/bin-2019/uautomizer/data/656d3905e/612dffcf1bda4b2e90773fd467a5f977/FLAGd318819a1 [2018-12-01 15:16:05,342 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 15:16:05,343 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fd0ad6d6-6f45-4215-bfdb-dd254d79619d/sv-benchmarks/c/systemc/pc_sfifo_1_false-unreach-call_false-termination.cil.c [2018-12-01 15:16:05,347 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fd0ad6d6-6f45-4215-bfdb-dd254d79619d/bin-2019/uautomizer/data/656d3905e/612dffcf1bda4b2e90773fd467a5f977/FLAGd318819a1 [2018-12-01 15:16:05,357 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fd0ad6d6-6f45-4215-bfdb-dd254d79619d/bin-2019/uautomizer/data/656d3905e/612dffcf1bda4b2e90773fd467a5f977 [2018-12-01 15:16:05,359 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 15:16:05,361 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 15:16:05,361 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 15:16:05,361 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 15:16:05,364 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 15:16:05,364 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 03:16:05" (1/1) ... [2018-12-01 15:16:05,366 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15ed00b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:16:05, skipping insertion in model container [2018-12-01 15:16:05,366 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 03:16:05" (1/1) ... [2018-12-01 15:16:05,370 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 15:16:05,386 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 15:16:05,487 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 15:16:05,490 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 15:16:05,508 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 15:16:05,517 INFO L195 MainTranslator]: Completed translation [2018-12-01 15:16:05,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:16:05 WrapperNode [2018-12-01 15:16:05,517 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 15:16:05,518 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 15:16:05,518 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 15:16:05,518 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 15:16:05,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:16:05" (1/1) ... [2018-12-01 15:16:05,527 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:16:05" (1/1) ... [2018-12-01 15:16:05,571 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 15:16:05,572 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 15:16:05,572 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 15:16:05,572 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 15:16:05,578 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:16:05" (1/1) ... [2018-12-01 15:16:05,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:16:05" (1/1) ... [2018-12-01 15:16:05,579 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:16:05" (1/1) ... [2018-12-01 15:16:05,579 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:16:05" (1/1) ... [2018-12-01 15:16:05,581 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:16:05" (1/1) ... [2018-12-01 15:16:05,585 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:16:05" (1/1) ... [2018-12-01 15:16:05,586 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:16:05" (1/1) ... [2018-12-01 15:16:05,587 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 15:16:05,587 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 15:16:05,588 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 15:16:05,588 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 15:16:05,588 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:16:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd0ad6d6-6f45-4215-bfdb-dd254d79619d/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-12-01 15:16:05,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 15:16:05,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 15:16:05,834 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 15:16:05,834 INFO L280 CfgBuilder]: Removed 44 assue(true) statements. [2018-12-01 15:16:05,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:16:05 BoogieIcfgContainer [2018-12-01 15:16:05,835 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 15:16:05,835 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-01 15:16:05,835 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-01 15:16:05,838 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-01 15:16:05,839 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 15:16:05,839 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.12 03:16:05" (1/3) ... [2018-12-01 15:16:05,839 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37dcd15f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 03:16:05, skipping insertion in model container [2018-12-01 15:16:05,840 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 15:16:05,840 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:16:05" (2/3) ... [2018-12-01 15:16:05,840 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37dcd15f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 03:16:05, skipping insertion in model container [2018-12-01 15:16:05,840 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 15:16:05,840 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:16:05" (3/3) ... [2018-12-01 15:16:05,841 INFO L375 chiAutomizerObserver]: Analyzing ICFG pc_sfifo_1_false-unreach-call_false-termination.cil.c [2018-12-01 15:16:05,872 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 15:16:05,873 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-01 15:16:05,873 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-01 15:16:05,873 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-01 15:16:05,873 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 15:16:05,873 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 15:16:05,873 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-01 15:16:05,873 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 15:16:05,873 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-01 15:16:05,882 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states. [2018-12-01 15:16:05,896 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2018-12-01 15:16:05,896 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 15:16:05,896 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 15:16:05,901 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-01 15:16:05,901 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:16:05,901 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-01 15:16:05,901 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states. [2018-12-01 15:16:05,903 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2018-12-01 15:16:05,903 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 15:16:05,903 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 15:16:05,904 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-01 15:16:05,904 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:16:05,908 INFO L794 eck$LassoCheckResult]: Stem: 33#ULTIMATE.startENTRYtrue ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 8#L-1true havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 75#L346true havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 77#L196true assume !(1 == ~p_dw_i~0);~p_dw_st~0 := 2; 74#L196-2true assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 61#L313-1true [2018-12-01 15:16:05,909 INFO L796 eck$LassoCheckResult]: Loop: 61#L313-1true assume !false; 22#L314true start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 64#L262true assume false; 37#L278true havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 69#L214-1true assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 14#L226-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 42#L227-1true stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 23#L292true assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 12#L299true stop_simulation_#res := stop_simulation_~__retres2~0; 39#L300true start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 67#L320true assume !(0 != start_simulation_~tmp~3); 61#L313-1true [2018-12-01 15:16:05,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:16:05,912 INFO L82 PathProgramCache]: Analyzing trace with hash 28692871, now seen corresponding path program 1 times [2018-12-01 15:16:05,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:16:05,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:16:05,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:05,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:16:05,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:05,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:16:05,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:16:05,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:16:05,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:16:05,992 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 15:16:05,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:16:05,993 INFO L82 PathProgramCache]: Analyzing trace with hash -778318386, now seen corresponding path program 1 times [2018-12-01 15:16:05,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:16:05,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:16:05,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:05,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:16:05,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:05,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:16:05,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:16:05,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:16:05,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-01 15:16:06,000 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 15:16:06,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:16:06,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:16:06,011 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 3 states. [2018-12-01 15:16:06,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:16:06,031 INFO L93 Difference]: Finished difference Result 75 states and 103 transitions. [2018-12-01 15:16:06,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:16:06,033 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 103 transitions. [2018-12-01 15:16:06,034 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2018-12-01 15:16:06,038 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 68 states and 96 transitions. [2018-12-01 15:16:06,039 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2018-12-01 15:16:06,040 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2018-12-01 15:16:06,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 96 transitions. [2018-12-01 15:16:06,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 15:16:06,041 INFO L705 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2018-12-01 15:16:06,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 96 transitions. [2018-12-01 15:16:06,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-01 15:16:06,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-01 15:16:06,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2018-12-01 15:16:06,064 INFO L728 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2018-12-01 15:16:06,064 INFO L608 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2018-12-01 15:16:06,065 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-01 15:16:06,065 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 96 transitions. [2018-12-01 15:16:06,065 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2018-12-01 15:16:06,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 15:16:06,066 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 15:16:06,066 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-01 15:16:06,066 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:16:06,066 INFO L794 eck$LassoCheckResult]: Stem: 205#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 169#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 170#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 226#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 225#L196-2 assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 222#L313-1 [2018-12-01 15:16:06,066 INFO L796 eck$LassoCheckResult]: Loop: 222#L313-1 assume !false; 191#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 174#L262 assume !false; 213#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 214#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 185#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 186#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 199#L242 assume !(0 != eval_~tmp___1~0); 200#L278 havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 206#L214-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 183#L226-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 184#L227-1 stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 192#L292 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 179#L299 stop_simulation_#res := stop_simulation_~__retres2~0; 180#L300 start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 210#L320 assume !(0 != start_simulation_~tmp~3); 222#L313-1 [2018-12-01 15:16:06,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:16:06,067 INFO L82 PathProgramCache]: Analyzing trace with hash 28692809, now seen corresponding path program 1 times [2018-12-01 15:16:06,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:16:06,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:16:06,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:06,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:16:06,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:06,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:16:06,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:16:06,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:16:06,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-01 15:16:06,081 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 15:16:06,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:16:06,082 INFO L82 PathProgramCache]: Analyzing trace with hash -852169887, now seen corresponding path program 1 times [2018-12-01 15:16:06,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:16:06,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:16:06,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:06,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:16:06,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:06,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:16:06,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:16:06,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:16:06,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 15:16:06,111 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 15:16:06,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:16:06,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:16:06,112 INFO L87 Difference]: Start difference. First operand 68 states and 96 transitions. cyclomatic complexity: 29 Second operand 3 states. [2018-12-01 15:16:06,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:16:06,117 INFO L93 Difference]: Finished difference Result 68 states and 95 transitions. [2018-12-01 15:16:06,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:16:06,118 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 95 transitions. [2018-12-01 15:16:06,119 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2018-12-01 15:16:06,120 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 68 states and 95 transitions. [2018-12-01 15:16:06,120 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2018-12-01 15:16:06,120 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2018-12-01 15:16:06,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 95 transitions. [2018-12-01 15:16:06,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 15:16:06,120 INFO L705 BuchiCegarLoop]: Abstraction has 68 states and 95 transitions. [2018-12-01 15:16:06,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 95 transitions. [2018-12-01 15:16:06,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-01 15:16:06,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-01 15:16:06,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 95 transitions. [2018-12-01 15:16:06,123 INFO L728 BuchiCegarLoop]: Abstraction has 68 states and 95 transitions. [2018-12-01 15:16:06,123 INFO L608 BuchiCegarLoop]: Abstraction has 68 states and 95 transitions. [2018-12-01 15:16:06,123 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-01 15:16:06,123 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 95 transitions. [2018-12-01 15:16:06,123 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2018-12-01 15:16:06,123 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 15:16:06,124 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 15:16:06,124 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-01 15:16:06,124 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:16:06,124 INFO L794 eck$LassoCheckResult]: Stem: 350#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 314#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 315#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 371#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 370#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 367#L313-1 [2018-12-01 15:16:06,124 INFO L796 eck$LassoCheckResult]: Loop: 367#L313-1 assume !false; 336#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 319#L262 assume !false; 358#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 359#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 330#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 331#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 344#L242 assume !(0 != eval_~tmp___1~0); 345#L278 havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 351#L214-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 328#L226-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 329#L227-1 stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 337#L292 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 324#L299 stop_simulation_#res := stop_simulation_~__retres2~0; 325#L300 start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 352#L320 assume !(0 != start_simulation_~tmp~3); 367#L313-1 [2018-12-01 15:16:06,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:16:06,124 INFO L82 PathProgramCache]: Analyzing trace with hash 28692807, now seen corresponding path program 1 times [2018-12-01 15:16:06,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:16:06,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:16:06,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:06,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:16:06,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:06,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:16:06,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:16:06,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:16:06,144 INFO L82 PathProgramCache]: Analyzing trace with hash -852169887, now seen corresponding path program 2 times [2018-12-01 15:16:06,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:16:06,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:16:06,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:06,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:16:06,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:06,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:16:06,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:16:06,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:16:06,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 15:16:06,168 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 15:16:06,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 15:16:06,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 15:16:06,169 INFO L87 Difference]: Start difference. First operand 68 states and 95 transitions. cyclomatic complexity: 28 Second operand 5 states. [2018-12-01 15:16:06,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:16:06,233 INFO L93 Difference]: Finished difference Result 134 states and 185 transitions. [2018-12-01 15:16:06,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 15:16:06,233 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 185 transitions. [2018-12-01 15:16:06,234 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 129 [2018-12-01 15:16:06,235 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 134 states and 185 transitions. [2018-12-01 15:16:06,235 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 134 [2018-12-01 15:16:06,236 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 134 [2018-12-01 15:16:06,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 185 transitions. [2018-12-01 15:16:06,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 15:16:06,236 INFO L705 BuchiCegarLoop]: Abstraction has 134 states and 185 transitions. [2018-12-01 15:16:06,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states and 185 transitions. [2018-12-01 15:16:06,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 71. [2018-12-01 15:16:06,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-01 15:16:06,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 98 transitions. [2018-12-01 15:16:06,240 INFO L728 BuchiCegarLoop]: Abstraction has 71 states and 98 transitions. [2018-12-01 15:16:06,240 INFO L608 BuchiCegarLoop]: Abstraction has 71 states and 98 transitions. [2018-12-01 15:16:06,240 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-01 15:16:06,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 98 transitions. [2018-12-01 15:16:06,240 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2018-12-01 15:16:06,240 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 15:16:06,240 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 15:16:06,241 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-01 15:16:06,241 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:16:06,241 INFO L794 eck$LassoCheckResult]: Stem: 565#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 532#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 533#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 591#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 590#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 587#L313-1 [2018-12-01 15:16:06,241 INFO L796 eck$LassoCheckResult]: Loop: 587#L313-1 assume !false; 554#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 535#L262 assume !false; 577#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 578#L214 assume !(0 == ~p_dw_st~0); 585#L218 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 548#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 549#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 592#L242 assume !(0 != eval_~tmp___1~0); 568#L278 havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 569#L214-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 546#L226-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 547#L227-1 stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 555#L292 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 542#L299 stop_simulation_#res := stop_simulation_~__retres2~0; 543#L300 start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 572#L320 assume !(0 != start_simulation_~tmp~3); 587#L313-1 [2018-12-01 15:16:06,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:16:06,241 INFO L82 PathProgramCache]: Analyzing trace with hash 28692807, now seen corresponding path program 2 times [2018-12-01 15:16:06,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:16:06,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:16:06,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:06,242 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 15:16:06,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:06,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:16:06,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:16:06,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:16:06,252 INFO L82 PathProgramCache]: Analyzing trace with hash 6171900, now seen corresponding path program 1 times [2018-12-01 15:16:06,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:16:06,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:16:06,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:06,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 15:16:06,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:06,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:16:06,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:16:06,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:16:06,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:16:06,266 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 15:16:06,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:16:06,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:16:06,267 INFO L87 Difference]: Start difference. First operand 71 states and 98 transitions. cyclomatic complexity: 28 Second operand 3 states. [2018-12-01 15:16:06,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:16:06,282 INFO L93 Difference]: Finished difference Result 116 states and 156 transitions. [2018-12-01 15:16:06,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:16:06,283 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 156 transitions. [2018-12-01 15:16:06,284 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 109 [2018-12-01 15:16:06,284 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 116 states and 156 transitions. [2018-12-01 15:16:06,285 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2018-12-01 15:16:06,285 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2018-12-01 15:16:06,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 156 transitions. [2018-12-01 15:16:06,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 15:16:06,285 INFO L705 BuchiCegarLoop]: Abstraction has 116 states and 156 transitions. [2018-12-01 15:16:06,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 156 transitions. [2018-12-01 15:16:06,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 99. [2018-12-01 15:16:06,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-01 15:16:06,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 132 transitions. [2018-12-01 15:16:06,289 INFO L728 BuchiCegarLoop]: Abstraction has 99 states and 132 transitions. [2018-12-01 15:16:06,289 INFO L608 BuchiCegarLoop]: Abstraction has 99 states and 132 transitions. [2018-12-01 15:16:06,289 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-01 15:16:06,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 132 transitions. [2018-12-01 15:16:06,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2018-12-01 15:16:06,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 15:16:06,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 15:16:06,291 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:16:06,291 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] [2018-12-01 15:16:06,292 INFO L794 eck$LassoCheckResult]: Stem: 761#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 725#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 726#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 792#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 790#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 791#L313-1 assume !false; 803#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 801#L262 [2018-12-01 15:16:06,292 INFO L796 eck$LassoCheckResult]: Loop: 801#L262 assume !false; 800#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 799#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 798#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 797#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 796#L242 assume 0 != eval_~tmp___1~0; 795#L242-1 assume !(0 == ~p_dw_st~0); 754#L247 assume 0 == ~c_dr_st~0;eval_~tmp___0~1 := eval_#t~nondet5;havoc eval_#t~nondet5; 727#L266 assume 0 != eval_~tmp___0~1;~c_dr_st~0 := 1;havoc do_read_c_~a~0;havoc do_read_c_~a~0; 729#L139 assume !(0 == ~c_dr_pc~0); 744#L142 assume 1 == ~c_dr_pc~0; 745#L143 do_read_c_~a~0 := ~a_t~0; 750#L152-1 do_read_c_~a~0 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_read_ev~0 := 1;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 784#L32-3 assume !(1 == ~p_dw_pc~0); 785#L32-5 is_do_write_p_triggered_~__retres1~0 := 0; 813#L43-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 812#L44-1 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 811#L74-3 assume 0 != immediate_notify_threads_~tmp~0;~p_dw_st~0 := 0; 756#L74-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 715#L51-3 assume 1 == ~c_dr_pc~0; 716#L52-1 assume 1 == ~q_write_ev~0;is_do_read_c_triggered_~__retres1~1 := 1; 810#L62-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 809#L63-1 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 808#L82-3 assume 0 != immediate_notify_threads_~tmp___0~0;~c_dr_st~0 := 0; 807#L82-5 ~q_read_ev~0 := 2; 806#L172 assume ~p_last_write~0 == ~c_last_read~0; 805#L173 assume ~p_num_write~0 == ~c_num_read~0; 804#L10-2 assume !false; 802#L151 assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 1;~a_t~0 := do_read_c_~a~0; 801#L262 [2018-12-01 15:16:06,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:16:06,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1803984585, now seen corresponding path program 1 times [2018-12-01 15:16:06,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:16:06,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:16:06,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:06,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:16:06,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:06,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:16:06,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:16:06,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:16:06,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1836630604, now seen corresponding path program 1 times [2018-12-01 15:16:06,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:16:06,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:16:06,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:06,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:16:06,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:06,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:16:06,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:16:06,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:16:06,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:16:06,315 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 15:16:06,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:16:06,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:16:06,315 INFO L87 Difference]: Start difference. First operand 99 states and 132 transitions. cyclomatic complexity: 34 Second operand 3 states. [2018-12-01 15:16:06,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:16:06,330 INFO L93 Difference]: Finished difference Result 116 states and 154 transitions. [2018-12-01 15:16:06,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:16:06,331 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 154 transitions. [2018-12-01 15:16:06,331 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 109 [2018-12-01 15:16:06,332 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 116 states and 154 transitions. [2018-12-01 15:16:06,332 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2018-12-01 15:16:06,332 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2018-12-01 15:16:06,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 154 transitions. [2018-12-01 15:16:06,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 15:16:06,333 INFO L705 BuchiCegarLoop]: Abstraction has 116 states and 154 transitions. [2018-12-01 15:16:06,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 154 transitions. [2018-12-01 15:16:06,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 99. [2018-12-01 15:16:06,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-01 15:16:06,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 130 transitions. [2018-12-01 15:16:06,335 INFO L728 BuchiCegarLoop]: Abstraction has 99 states and 130 transitions. [2018-12-01 15:16:06,335 INFO L608 BuchiCegarLoop]: Abstraction has 99 states and 130 transitions. [2018-12-01 15:16:06,335 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-01 15:16:06,335 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 130 transitions. [2018-12-01 15:16:06,336 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2018-12-01 15:16:06,336 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 15:16:06,336 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 15:16:06,336 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:16:06,336 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] [2018-12-01 15:16:06,336 INFO L794 eck$LassoCheckResult]: Stem: 980#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 946#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 947#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 1014#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 1013#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 1003#L313-1 assume !false; 968#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 969#L262 [2018-12-01 15:16:06,336 INFO L796 eck$LassoCheckResult]: Loop: 969#L262 assume !false; 992#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 993#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 1011#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1021#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 1020#L242 assume 0 != eval_~tmp___1~0; 1018#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 1004#L251 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 998#L96 assume 0 == ~p_dw_pc~0; 991#L107-1 assume !false; 997#L108 assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 974#L247 assume 0 == ~c_dr_st~0;eval_~tmp___0~1 := eval_#t~nondet5;havoc eval_#t~nondet5; 948#L266 assume 0 != eval_~tmp___0~1;~c_dr_st~0 := 1;havoc do_read_c_~a~0;havoc do_read_c_~a~0; 950#L139 assume !(0 == ~c_dr_pc~0); 965#L142 assume 1 == ~c_dr_pc~0; 966#L143 do_read_c_~a~0 := ~a_t~0; 971#L152-1 do_read_c_~a~0 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_read_ev~0 := 1;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 1005#L32-3 assume !(1 == ~p_dw_pc~0); 1006#L32-5 is_do_write_p_triggered_~__retres1~0 := 0; 1034#L43-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 983#L44-1 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 975#L74-3 assume 0 != immediate_notify_threads_~tmp~0;~p_dw_st~0 := 0; 976#L74-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 1032#L51-3 assume 1 == ~c_dr_pc~0; 1030#L52-1 assume 1 == ~q_write_ev~0;is_do_read_c_triggered_~__retres1~1 := 1; 1029#L62-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 1028#L63-1 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 1027#L82-3 assume 0 != immediate_notify_threads_~tmp___0~0;~c_dr_st~0 := 0; 1026#L82-5 ~q_read_ev~0 := 2; 1025#L172 assume ~p_last_write~0 == ~c_last_read~0; 1024#L173 assume ~p_num_write~0 == ~c_num_read~0; 1008#L10-2 assume !false; 999#L151 assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 1;~a_t~0 := do_read_c_~a~0; 969#L262 [2018-12-01 15:16:06,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:16:06,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1803984585, now seen corresponding path program 2 times [2018-12-01 15:16:06,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:16:06,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:16:06,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:06,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:16:06,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:06,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:16:06,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:16:06,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:16:06,343 INFO L82 PathProgramCache]: Analyzing trace with hash 331104409, now seen corresponding path program 1 times [2018-12-01 15:16:06,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:16:06,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:16:06,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:06,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 15:16:06,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:06,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:16:06,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:16:06,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:16:06,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:16:06,356 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 15:16:06,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:16:06,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:16:06,356 INFO L87 Difference]: Start difference. First operand 99 states and 130 transitions. cyclomatic complexity: 32 Second operand 3 states. [2018-12-01 15:16:06,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:16:06,369 INFO L93 Difference]: Finished difference Result 125 states and 159 transitions. [2018-12-01 15:16:06,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:16:06,370 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 159 transitions. [2018-12-01 15:16:06,370 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 108 [2018-12-01 15:16:06,371 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 125 states and 159 transitions. [2018-12-01 15:16:06,371 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2018-12-01 15:16:06,372 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2018-12-01 15:16:06,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 159 transitions. [2018-12-01 15:16:06,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 15:16:06,372 INFO L705 BuchiCegarLoop]: Abstraction has 125 states and 159 transitions. [2018-12-01 15:16:06,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 159 transitions. [2018-12-01 15:16:06,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-12-01 15:16:06,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-12-01 15:16:06,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 159 transitions. [2018-12-01 15:16:06,376 INFO L728 BuchiCegarLoop]: Abstraction has 125 states and 159 transitions. [2018-12-01 15:16:06,377 INFO L608 BuchiCegarLoop]: Abstraction has 125 states and 159 transitions. [2018-12-01 15:16:06,377 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-01 15:16:06,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 159 transitions. [2018-12-01 15:16:06,377 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 108 [2018-12-01 15:16:06,377 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 15:16:06,377 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 15:16:06,378 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:16:06,378 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:16:06,378 INFO L794 eck$LassoCheckResult]: Stem: 1211#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 1176#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 1177#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 1250#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 1249#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 1242#L313-1 assume !false; 1199#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 1200#L262 assume !false; 1266#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1265#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 1264#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1263#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 1207#L242 assume 0 != eval_~tmp___1~0; 1204#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 1205#L251 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 1243#L96 assume 0 == ~p_dw_pc~0; 1231#L107-1 [2018-12-01 15:16:06,378 INFO L796 eck$LassoCheckResult]: Loop: 1231#L107-1 assume !false; 1233#L108 assume !(0 == ~q_free~0); 1193#L109 ~q_buf_0~0 := do_write_p_#t~nondet2;havoc do_write_p_#t~nondet2;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 1194#L32 assume !(1 == ~p_dw_pc~0); 1246#L32-2 is_do_write_p_triggered_~__retres1~0 := 0; 1185#L43 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 1186#L44 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 1219#L74 assume 0 != immediate_notify_threads_~tmp~0;~p_dw_st~0 := 0; 1208#L74-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 1173#L51 assume !(1 == ~c_dr_pc~0); 1169#L51-2 is_do_read_c_triggered_~__retres1~1 := 0; 1170#L62 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 1175#L63 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 1232#L82 assume 0 != immediate_notify_threads_~tmp___0~0;~c_dr_st~0 := 0; 1230#L82-2 ~q_write_ev~0 := 2; 1231#L107-1 [2018-12-01 15:16:06,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:16:06,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1783039958, now seen corresponding path program 1 times [2018-12-01 15:16:06,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:16:06,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:16:06,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:06,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:16:06,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:16:06,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:16:06,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:16:06,390 INFO L82 PathProgramCache]: Analyzing trace with hash -62972986, now seen corresponding path program 1 times [2018-12-01 15:16:06,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:16:06,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:16:06,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:06,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:16:06,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:06,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:16:06,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:16:06,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:16:06,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 15:16:06,433 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 15:16:06,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 15:16:06,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 15:16:06,434 INFO L87 Difference]: Start difference. First operand 125 states and 159 transitions. cyclomatic complexity: 36 Second operand 5 states. [2018-12-01 15:16:06,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:16:06,480 INFO L93 Difference]: Finished difference Result 275 states and 346 transitions. [2018-12-01 15:16:06,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 15:16:06,481 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 275 states and 346 transitions. [2018-12-01 15:16:06,482 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 255 [2018-12-01 15:16:06,483 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 275 states to 275 states and 346 transitions. [2018-12-01 15:16:06,483 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 275 [2018-12-01 15:16:06,483 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 275 [2018-12-01 15:16:06,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 275 states and 346 transitions. [2018-12-01 15:16:06,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 15:16:06,484 INFO L705 BuchiCegarLoop]: Abstraction has 275 states and 346 transitions. [2018-12-01 15:16:06,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states and 346 transitions. [2018-12-01 15:16:06,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 134. [2018-12-01 15:16:06,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-01 15:16:06,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 167 transitions. [2018-12-01 15:16:06,487 INFO L728 BuchiCegarLoop]: Abstraction has 134 states and 167 transitions. [2018-12-01 15:16:06,487 INFO L608 BuchiCegarLoop]: Abstraction has 134 states and 167 transitions. [2018-12-01 15:16:06,487 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-01 15:16:06,487 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 134 states and 167 transitions. [2018-12-01 15:16:06,488 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 117 [2018-12-01 15:16:06,488 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 15:16:06,488 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 15:16:06,488 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:16:06,488 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:16:06,488 INFO L794 eck$LassoCheckResult]: Stem: 1621#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 1589#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 1590#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 1659#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 1657#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 1658#L313-1 assume !false; 1690#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 1689#L262 assume !false; 1688#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1687#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 1686#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1685#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 1684#L242 assume 0 != eval_~tmp___1~0; 1683#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 1682#L251 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 1680#L96 assume 0 == ~p_dw_pc~0; 1642#L107-1 [2018-12-01 15:16:06,488 INFO L796 eck$LassoCheckResult]: Loop: 1642#L107-1 assume !false; 1644#L108 assume !(0 == ~q_free~0); 1606#L109 ~q_buf_0~0 := do_write_p_#t~nondet2;havoc do_write_p_#t~nondet2;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 1607#L32 assume !(1 == ~p_dw_pc~0); 1653#L32-2 is_do_write_p_triggered_~__retres1~0 := 0; 1598#L43 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 1599#L44 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 1633#L74 assume !(0 != immediate_notify_threads_~tmp~0); 1619#L74-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 1586#L51 assume 1 == ~c_dr_pc~0; 1587#L52 assume 1 == ~q_write_ev~0;is_do_read_c_triggered_~__retres1~1 := 1; 1583#L62 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 1588#L63 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 1643#L82 assume 0 != immediate_notify_threads_~tmp___0~0;~c_dr_st~0 := 0; 1641#L82-2 ~q_write_ev~0 := 2; 1642#L107-1 [2018-12-01 15:16:06,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:16:06,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1783039958, now seen corresponding path program 2 times [2018-12-01 15:16:06,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:16:06,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:16:06,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:06,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:16:06,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:06,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:16:06,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:16:06,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:16:06,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1078264795, now seen corresponding path program 1 times [2018-12-01 15:16:06,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:16:06,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:16:06,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:06,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 15:16:06,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:16:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:16:06,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:16:06,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1917816028, now seen corresponding path program 1 times [2018-12-01 15:16:06,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:16:06,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:16:06,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:06,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:16:06,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:06,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:16:06,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:16:06,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:16:06,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:16:06,599 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 15:16:06,600 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 15:16:06,600 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 15:16:06,600 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 15:16:06,600 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-01 15:16:06,600 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 15:16:06,600 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 15:16:06,600 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 15:16:06,600 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1_false-unreach-call_false-termination.cil.c_Iteration8_Loop [2018-12-01 15:16:06,600 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 15:16:06,601 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 15:16:06,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:06,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:06,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:06,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:06,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:06,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:06,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:06,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:06,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:06,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:06,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:06,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:06,746 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 15:16:06,747 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd0ad6d6-6f45-4215-bfdb-dd254d79619d/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-12-01 15:16:06,751 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 15:16:06,751 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 15:16:06,757 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 15:16:06,758 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_is_do_read_c_triggered_#res=1, ULTIMATE.start_immediate_notify_threads_~tmp___0~0=1, ULTIMATE.start_is_do_read_c_triggered_~__retres1~1=1} Honda state: {ULTIMATE.start_is_do_read_c_triggered_#res=1, ULTIMATE.start_immediate_notify_threads_~tmp___0~0=1, ULTIMATE.start_is_do_read_c_triggered_~__retres1~1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd0ad6d6-6f45-4215-bfdb-dd254d79619d/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-12-01 15:16:06,773 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 15:16:06,773 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 15:16:06,776 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 15:16:06,776 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_is_do_write_p_triggered_#res=0, ULTIMATE.start_is_do_write_p_triggered_~__retres1~0=0} Honda state: {ULTIMATE.start_is_do_write_p_triggered_#res=0, ULTIMATE.start_is_do_write_p_triggered_~__retres1~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd0ad6d6-6f45-4215-bfdb-dd254d79619d/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-12-01 15:16:06,791 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 15:16:06,791 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd0ad6d6-6f45-4215-bfdb-dd254d79619d/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-12-01 15:16:06,808 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-01 15:16:06,808 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 15:16:06,828 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-01 15:16:06,829 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 15:16:06,829 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 15:16:06,829 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 15:16:06,829 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 15:16:06,829 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 15:16:06,829 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 15:16:06,829 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 15:16:06,829 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 15:16:06,829 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1_false-unreach-call_false-termination.cil.c_Iteration8_Loop [2018-12-01 15:16:06,830 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 15:16:06,830 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 15:16:06,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:06,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:06,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:06,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:06,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:06,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:06,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:06,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:06,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:06,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:06,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:06,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:07,001 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 15:16:07,004 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 15:16:07,005 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:16:07,008 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 15:16:07,008 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,009 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,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-12-01 15:16:07,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,010 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 15:16:07,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:16:07,011 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:07,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,013 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,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-12-01 15:16:07,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,014 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:16:07,014 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 15:16:07,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,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-12-01 15:16:07,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,016 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 15:16:07,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:16:07,017 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:07,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,018 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,019 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:16:07,019 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 15:16:07,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,020 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:16:07,021 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 15:16:07,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,022 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,023 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:16:07,023 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 15:16:07,024 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,027 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:16:07,028 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 15:16:07,028 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,029 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,030 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,030 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:16:07,031 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 15:16:07,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,032 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:16:07,033 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 15:16:07,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,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-12-01 15:16:07,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,036 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:16:07,036 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 15:16:07,036 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,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-12-01 15:16:07,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:16:07,039 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 15:16:07,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,039 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,040 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-12-01 15:16:07,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-12-01 15:16:07,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,040 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 15:16:07,041 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 15:16:07,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,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-12-01 15:16:07,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,042 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 15:16:07,042 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 15:16:07,043 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 15:16:07,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,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-12-01 15:16:07,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,048 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 15:16:07,048 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 15:16:07,049 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,050 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,051 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,051 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,051 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 15:16:07,051 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 15:16:07,052 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 15:16:07,052 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,053 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,053 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,053 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 15:16:07,054 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 15:16:07,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,054 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,055 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 15:16:07,055 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 15:16:07,055 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,056 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,057 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,057 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 15:16:07,058 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 15:16:07,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,060 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,061 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,061 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,062 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 15:16:07,062 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 15:16:07,062 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,064 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,065 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,065 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 15:16:07,066 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 15:16:07,066 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,066 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,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-12-01 15:16:07,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,067 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,068 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 15:16:07,068 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 15:16:07,068 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,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-12-01 15:16:07,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,071 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,071 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 15:16:07,072 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 15:16:07,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,073 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,073 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,074 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 15:16:07,074 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 15:16:07,074 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,075 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,076 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-12-01 15:16:07,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-12-01 15:16:07,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,076 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,077 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:07,077 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:07,077 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,078 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,079 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 15:16:07,079 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:07,080 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 15:16:07,080 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,084 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,084 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,085 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,085 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:07,086 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:07,086 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,087 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,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-12-01 15:16:07,088 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,088 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,088 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 15:16:07,088 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:07,089 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 15:16:07,089 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,090 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,090 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,091 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,091 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:07,092 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:07,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,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-12-01 15:16:07,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,094 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:07,094 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:07,094 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,095 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,096 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:07,097 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:07,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,100 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,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-12-01 15:16:07,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,101 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,102 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:07,102 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:07,102 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,104 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,106 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:07,106 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:07,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,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-12-01 15:16:07,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,108 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,108 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:07,109 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:07,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,112 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:07,112 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:07,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,113 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,114 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,114 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,115 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:07,115 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:07,115 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,116 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-12-01 15:16:07,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,117 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,117 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 15:16:07,118 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 15:16:07,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,119 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,120 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 15:16:07,120 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 15:16:07,121 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-01 15:16:07,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,126 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 15:16:07,126 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 15:16:07,126 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,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-12-01 15:16:07,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,130 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 15:16:07,130 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 15:16:07,130 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-01 15:16:07,130 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,132 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 15:16:07,133 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 15:16:07,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,134 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,134 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 15:16:07,135 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 15:16:07,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,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-12-01 15:16:07,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,136 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 15:16:07,137 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 15:16:07,137 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,142 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 15:16:07,143 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 15:16:07,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,146 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,147 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 15:16:07,147 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 15:16:07,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,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-12-01 15:16:07,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,149 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 15:16:07,149 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 15:16:07,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,152 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,152 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 15:16:07,153 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 15:16:07,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,154 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,154 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,155 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 15:16:07,155 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 15:16:07,155 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,156 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-12-01 15:16:07,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-12-01 15:16:07,156 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,157 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 15:16:07,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,157 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 15:16:07,157 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 15:16:07,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,158 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,159 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 15:16:07,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,159 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 15:16:07,159 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 15:16:07,159 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 15:16:07,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,165 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,165 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 15:16:07,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,166 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 15:16:07,166 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 15:16:07,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,169 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,169 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,169 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 15:16:07,169 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,170 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 15:16:07,170 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 15:16:07,170 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 15:16:07,170 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,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-12-01 15:16:07,172 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,172 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 15:16:07,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,172 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 15:16:07,173 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 15:16:07,173 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,174 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,174 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,174 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 15:16:07,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,174 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 15:16:07,175 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 15:16:07,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,176 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,176 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,176 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,177 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 15:16:07,177 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,177 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 15:16:07,178 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 15:16:07,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,183 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,183 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 15:16:07,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,184 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 15:16:07,184 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 15:16:07,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,187 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,187 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 15:16:07,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,188 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 15:16:07,188 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 15:16:07,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,189 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,189 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,190 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 15:16:07,190 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,190 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 15:16:07,190 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 15:16:07,190 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,196 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,196 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 15:16:07,196 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,196 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 15:16:07,197 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 15:16:07,197 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,198 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,198 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,198 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 15:16:07,198 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,198 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 15:16:07,199 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 15:16:07,199 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,200 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-12-01 15:16:07,200 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,200 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,201 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-01 15:16:07,201 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,201 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:07,201 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:07,201 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,203 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,203 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-01 15:16:07,203 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,204 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 15:16:07,204 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:07,205 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 15:16:07,205 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,211 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,211 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,212 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,212 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-01 15:16:07,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,212 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:07,213 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:07,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,216 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,217 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,217 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-01 15:16:07,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,217 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 15:16:07,217 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:07,219 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 15:16:07,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,221 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,221 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-01 15:16:07,221 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,221 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:07,222 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:07,222 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,224 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,224 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-01 15:16:07,224 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,225 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:07,225 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:07,225 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,227 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,227 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-01 15:16:07,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,227 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:07,228 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:07,228 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,237 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,238 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,238 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,238 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-01 15:16:07,238 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,239 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:07,239 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:07,240 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,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-12-01 15:16:07,243 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,244 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-01 15:16:07,244 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,244 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:07,244 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:07,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,246 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,246 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,246 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-01 15:16:07,246 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,247 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:07,247 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:07,247 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,255 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,255 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-01 15:16:07,255 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,255 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:07,256 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:07,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,257 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,258 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,258 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-01 15:16:07,259 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,259 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:07,260 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:07,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,284 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-12-01 15:16:07,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,285 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,285 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 15:16:07,285 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,286 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 15:16:07,287 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 15:16:07,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,288 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,289 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,289 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 15:16:07,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,289 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 15:16:07,289 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 15:16:07,290 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-01 15:16:07,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,298 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,298 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 15:16:07,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,298 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 15:16:07,300 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 15:16:07,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,305 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,305 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,305 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 15:16:07,306 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,306 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 15:16:07,306 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 15:16:07,307 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-01 15:16:07,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,308 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,308 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 15:16:07,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,309 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 15:16:07,310 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 15:16:07,310 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,311 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,311 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,312 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 15:16:07,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,312 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 15:16:07,313 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 15:16:07,313 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,313 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,314 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,314 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,314 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 15:16:07,314 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,314 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 15:16:07,316 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 15:16:07,316 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,328 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,329 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,329 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 15:16:07,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,329 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 15:16:07,330 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 15:16:07,331 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,335 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,335 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,336 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,336 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 15:16:07,336 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,336 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 15:16:07,337 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 15:16:07,338 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,338 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,339 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,339 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 15:16:07,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,340 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 15:16:07,341 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 15:16:07,341 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,354 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,354 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 15:16:07,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,355 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 15:16:07,355 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 15:16:07,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,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-12-01 15:16:07,357 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,357 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 15:16:07,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,357 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 15:16:07,358 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 15:16:07,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,359 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-12-01 15:16:07,359 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,359 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,360 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 15:16:07,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,360 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:07,360 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:07,360 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,361 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,361 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,362 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,362 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 15:16:07,362 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,362 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 15:16:07,362 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:07,362 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 15:16:07,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,366 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,366 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,366 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 15:16:07,366 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,366 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:07,367 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:07,367 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,368 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,368 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 15:16:07,368 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,369 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 15:16:07,369 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:07,369 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 15:16:07,369 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,370 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,371 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,371 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 15:16:07,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,371 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:07,371 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:07,371 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,373 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,373 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,373 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 15:16:07,373 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,373 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:07,374 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:07,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,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-12-01 15:16:07,376 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,376 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 15:16:07,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,376 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:07,377 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:07,377 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,381 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,381 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 15:16:07,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,382 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:07,382 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:07,382 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,385 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,385 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 15:16:07,385 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,385 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:07,385 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:07,386 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,387 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,387 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,387 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 15:16:07,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,387 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:07,388 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:07,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,390 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,390 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 15:16:07,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,391 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:07,391 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:07,391 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,392 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,393 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,393 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 15:16:07,393 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,393 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:07,394 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:07,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,395 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-12-01 15:16:07,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,396 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,396 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 15:16:07,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,396 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-01 15:16:07,396 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 15:16:07,396 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,399 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,399 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 15:16:07,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,400 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 15:16:07,400 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-01 15:16:07,401 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-01 15:16:07,401 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,407 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,408 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,408 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 15:16:07,408 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,408 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-01 15:16:07,409 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 15:16:07,409 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,411 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,411 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,411 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 15:16:07,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,411 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 15:16:07,411 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-01 15:16:07,412 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-01 15:16:07,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,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-12-01 15:16:07,414 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,414 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 15:16:07,414 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,414 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-01 15:16:07,414 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 15:16:07,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,416 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,416 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,417 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,417 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 15:16:07,417 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,417 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-01 15:16:07,418 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 15:16:07,418 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,420 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,420 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 15:16:07,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,420 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-01 15:16:07,421 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 15:16:07,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,430 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,430 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,430 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 15:16:07,430 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,430 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-01 15:16:07,431 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 15:16:07,431 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,435 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,435 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,436 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 15:16:07,436 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,436 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-01 15:16:07,436 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 15:16:07,436 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,438 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,438 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,439 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,439 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 15:16:07,439 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,439 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-01 15:16:07,440 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 15:16:07,440 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,442 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,443 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,443 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,443 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 15:16:07,443 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,443 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-01 15:16:07,444 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 15:16:07,444 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,446 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,446 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,447 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:07,447 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 15:16:07,447 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,447 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-01 15:16:07,448 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 15:16:07,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,451 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:16:07,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:16:07,452 INFO L87 Difference]: Start difference. First operand 134 states and 167 transitions. cyclomatic complexity: 35 Second operand 3 states. [2018-12-01 15:16:07,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:16:07,487 INFO L93 Difference]: Finished difference Result 220 states and 270 transitions. [2018-12-01 15:16:07,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:16:07,488 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 220 states and 270 transitions. [2018-12-01 15:16:07,488 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 201 [2018-12-01 15:16:07,489 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 220 states to 220 states and 270 transitions. [2018-12-01 15:16:07,490 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 220 [2018-12-01 15:16:07,490 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 220 [2018-12-01 15:16:07,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 220 states and 270 transitions. [2018-12-01 15:16:07,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 15:16:07,490 INFO L705 BuchiCegarLoop]: Abstraction has 220 states and 270 transitions. [2018-12-01 15:16:07,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states and 270 transitions. [2018-12-01 15:16:07,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2018-12-01 15:16:07,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-12-01 15:16:07,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 270 transitions. [2018-12-01 15:16:07,495 INFO L728 BuchiCegarLoop]: Abstraction has 220 states and 270 transitions. [2018-12-01 15:16:07,495 INFO L608 BuchiCegarLoop]: Abstraction has 220 states and 270 transitions. [2018-12-01 15:16:07,495 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-01 15:16:07,495 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 220 states and 270 transitions. [2018-12-01 15:16:07,496 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 201 [2018-12-01 15:16:07,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 15:16:07,496 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 15:16:07,497 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:16:07,497 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:16:07,497 INFO L794 eck$LassoCheckResult]: Stem: 1989#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 1949#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 1950#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 2028#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 2026#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 2027#L313-1 assume !false; 2133#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 2132#L262 assume !false; 2131#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2130#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 2129#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2128#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 1980#L242 assume 0 != eval_~tmp___1~0; 1977#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 1978#L251 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 2013#L96 assume 0 == ~p_dw_pc~0; 2006#L107-1 [2018-12-01 15:16:07,497 INFO L796 eck$LassoCheckResult]: Loop: 2006#L107-1 assume !false; 2012#L108 assume !(0 == ~q_free~0); 1966#L109 ~q_buf_0~0 := do_write_p_#t~nondet2;havoc do_write_p_#t~nondet2;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 1967#L32 assume !(1 == ~p_dw_pc~0); 2021#L32-2 is_do_write_p_triggered_~__retres1~0 := 0; 1958#L43 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 1959#L44 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 1997#L74 assume !(0 != immediate_notify_threads_~tmp~0); 1981#L74-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 1947#L51 assume !(1 == ~c_dr_pc~0); 1943#L51-2 is_do_read_c_triggered_~__retres1~1 := 0; 1944#L62 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 1948#L63 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 2011#L82 assume 0 != immediate_notify_threads_~tmp___0~0;~c_dr_st~0 := 0; 2010#L82-2 ~q_write_ev~0 := 2; 2006#L107-1 [2018-12-01 15:16:07,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:16:07,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1783039958, now seen corresponding path program 3 times [2018-12-01 15:16:07,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:16:07,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:16:07,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:07,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:16:07,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:07,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:16:07,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:16:07,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:16:07,506 INFO L82 PathProgramCache]: Analyzing trace with hash -872319612, now seen corresponding path program 1 times [2018-12-01 15:16:07,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:16:07,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:16:07,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:07,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 15:16:07,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:07,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:16:07,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:16:07,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:16:07,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 15:16:07,542 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 15:16:07,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 15:16:07,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 15:16:07,543 INFO L87 Difference]: Start difference. First operand 220 states and 270 transitions. cyclomatic complexity: 54 Second operand 5 states. [2018-12-01 15:16:07,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:16:07,580 INFO L93 Difference]: Finished difference Result 428 states and 517 transitions. [2018-12-01 15:16:07,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 15:16:07,580 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 428 states and 517 transitions. [2018-12-01 15:16:07,582 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 387 [2018-12-01 15:16:07,583 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 428 states to 428 states and 517 transitions. [2018-12-01 15:16:07,583 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 428 [2018-12-01 15:16:07,583 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 428 [2018-12-01 15:16:07,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 428 states and 517 transitions. [2018-12-01 15:16:07,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 15:16:07,584 INFO L705 BuchiCegarLoop]: Abstraction has 428 states and 517 transitions. [2018-12-01 15:16:07,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states and 517 transitions. [2018-12-01 15:16:07,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 229. [2018-12-01 15:16:07,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-12-01 15:16:07,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 275 transitions. [2018-12-01 15:16:07,587 INFO L728 BuchiCegarLoop]: Abstraction has 229 states and 275 transitions. [2018-12-01 15:16:07,587 INFO L608 BuchiCegarLoop]: Abstraction has 229 states and 275 transitions. [2018-12-01 15:16:07,587 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-01 15:16:07,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 229 states and 275 transitions. [2018-12-01 15:16:07,588 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 210 [2018-12-01 15:16:07,588 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 15:16:07,588 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 15:16:07,588 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:16:07,588 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:16:07,588 INFO L794 eck$LassoCheckResult]: Stem: 2654#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 2613#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 2614#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 2701#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 2699#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 2700#L313-1 assume !false; 2747#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 2746#L262 assume !false; 2745#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2744#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 2743#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2742#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 2741#L242 assume 0 != eval_~tmp___1~0; 2740#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 2688#L251 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 2680#L96 assume 0 == ~p_dw_pc~0; 2670#L107-1 [2018-12-01 15:16:07,589 INFO L796 eck$LassoCheckResult]: Loop: 2670#L107-1 assume !false; 2679#L108 assume !(0 == ~q_free~0); 2757#L109 ~q_buf_0~0 := do_write_p_#t~nondet2;havoc do_write_p_#t~nondet2;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 2756#L32 assume !(1 == ~p_dw_pc~0); 2693#L32-2 is_do_write_p_triggered_~__retres1~0 := 0; 2622#L43 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 2623#L44 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 2664#L74 assume !(0 != immediate_notify_threads_~tmp~0); 2646#L74-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 2647#L51 assume !(1 == ~c_dr_pc~0); 2605#L51-2 is_do_read_c_triggered_~__retres1~1 := 0; 2606#L62 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 2677#L63 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 2678#L82 assume !(0 != immediate_notify_threads_~tmp___0~0); 2674#L82-2 ~q_write_ev~0 := 2; 2670#L107-1 [2018-12-01 15:16:07,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:16:07,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1783039958, now seen corresponding path program 4 times [2018-12-01 15:16:07,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:16:07,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:16:07,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:07,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:16:07,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:07,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:16:07,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:16:07,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:16:07,595 INFO L82 PathProgramCache]: Analyzing trace with hash -872319550, now seen corresponding path program 1 times [2018-12-01 15:16:07,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:16:07,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:16:07,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:07,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 15:16:07,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:07,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:16:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:16:07,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:16:07,599 INFO L82 PathProgramCache]: Analyzing trace with hash 2123761273, now seen corresponding path program 1 times [2018-12-01 15:16:07,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:16:07,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:16:07,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:07,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:16:07,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:07,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:16:07,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:16:07,657 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 15:16:07,657 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 15:16:07,657 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 15:16:07,657 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 15:16:07,657 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-01 15:16:07,657 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 15:16:07,657 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 15:16:07,657 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 15:16:07,657 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1_false-unreach-call_false-termination.cil.c_Iteration10_Loop [2018-12-01 15:16:07,657 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 15:16:07,657 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 15:16:07,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:07,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:07,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:07,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:07,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:07,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:07,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:07,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:07,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:07,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:07,749 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 15:16:07,749 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd0ad6d6-6f45-4215-bfdb-dd254d79619d/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 15:16:07,753 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 15:16:07,753 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 15:16:07,756 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 15:16:07,756 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_immediate_notify_threads_#t~ret0=0} Honda state: {ULTIMATE.start_immediate_notify_threads_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd0ad6d6-6f45-4215-bfdb-dd254d79619d/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-12-01 15:16:07,773 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 15:16:07,773 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 15:16:07,775 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 15:16:07,775 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_immediate_notify_threads_#t~ret1=0} Honda state: {ULTIMATE.start_immediate_notify_threads_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd0ad6d6-6f45-4215-bfdb-dd254d79619d/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-12-01 15:16:07,792 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 15:16:07,792 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd0ad6d6-6f45-4215-bfdb-dd254d79619d/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-12-01 15:16:07,813 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-01 15:16:07,813 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 15:16:07,833 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-01 15:16:07,834 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 15:16:07,835 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 15:16:07,835 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 15:16:07,835 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 15:16:07,835 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 15:16:07,835 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 15:16:07,835 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 15:16:07,835 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 15:16:07,835 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1_false-unreach-call_false-termination.cil.c_Iteration10_Loop [2018-12-01 15:16:07,835 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 15:16:07,835 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 15:16:07,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:07,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:07,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:07,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:07,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:07,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:07,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:07,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:07,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:07,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:07,934 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 15:16:07,934 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 15:16:07,935 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:16:07,935 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 15:16:07,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,937 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:16:07,938 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 15:16:07,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,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-12-01 15:16:07,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,939 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 15:16:07,940 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:16:07,940 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:07,940 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,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-12-01 15:16:07,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,942 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:16:07,943 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 15:16:07,943 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:16:07,945 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 15:16:07,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,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-12-01 15:16:07,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,947 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:16:07,947 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 15:16:07,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,948 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,949 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:16:07,949 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 15:16:07,950 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,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-12-01 15:16:07,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,951 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,951 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 15:16:07,951 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:16:07,952 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:07,952 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,953 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:16:07,954 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 15:16:07,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,954 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,955 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,955 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,955 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 15:16:07,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:16:07,956 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:07,956 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,956 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,956 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-12-01 15:16:07,957 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,957 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,958 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 15:16:07,958 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 15:16:07,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,958 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,959 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,959 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,960 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 15:16:07,960 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 15:16:07,960 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,960 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,961 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,961 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,961 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 15:16:07,961 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 15:16:07,962 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 15:16:07,962 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,964 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,965 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,965 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 15:16:07,965 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 15:16:07,965 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,966 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,967 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,968 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 15:16:07,968 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 15:16:07,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,969 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,970 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 15:16:07,970 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 15:16:07,970 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,972 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,972 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,972 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 15:16:07,973 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 15:16:07,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,974 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,974 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,974 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,975 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 15:16:07,975 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 15:16:07,975 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 15:16:07,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,976 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,977 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 15:16:07,977 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 15:16:07,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,978 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,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-12-01 15:16:07,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,979 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,979 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 15:16:07,980 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 15:16:07,980 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 15:16:07,980 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,980 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,981 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-12-01 15:16:07,981 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,982 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:07,982 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:07,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,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-12-01 15:16:07,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,984 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,984 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:07,984 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:07,984 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,985 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,986 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 15:16:07,986 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:07,987 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 15:16:07,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,990 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,990 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:07,991 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:07,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,992 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,993 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:07,993 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:07,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,995 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:07,995 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:07,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,996 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:07,997 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:07,997 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:07,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:07,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:07,999 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:07,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:07,999 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:07,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:07,999 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 15:16:08,000 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:08,000 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 15:16:08,000 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,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-12-01 15:16:08,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:08,001 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:08,001 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:08,002 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:08,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,003 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,003 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:08,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:08,004 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,004 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 15:16:08,004 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:08,004 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 15:16:08,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,005 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,005 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-12-01 15:16:08,005 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:08,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:08,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:08,006 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 15:16:08,006 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 15:16:08,006 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,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-12-01 15:16:08,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:08,007 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:08,008 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 15:16:08,008 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 15:16:08,008 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,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-12-01 15:16:08,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:08,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,009 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 15:16:08,009 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 15:16:08,010 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-01 15:16:08,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,013 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:08,013 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:08,013 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:08,014 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 15:16:08,014 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 15:16:08,014 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,015 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:08,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:08,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:08,016 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 15:16:08,016 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 15:16:08,016 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,017 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:08,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:08,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:08,018 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 15:16:08,018 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 15:16:08,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,019 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,019 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:08,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:08,020 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:08,020 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 15:16:08,020 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 15:16:08,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,022 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:08,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:08,023 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,023 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 15:16:08,023 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 15:16:08,023 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-01 15:16:08,023 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,024 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:08,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:08,025 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:08,025 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 15:16:08,025 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 15:16:08,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:08,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:08,027 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,028 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 15:16:08,028 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 15:16:08,028 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-01 15:16:08,028 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,029 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,029 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-12-01 15:16:08,029 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:08,029 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:08,029 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 15:16:08,030 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:08,030 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 15:16:08,030 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 15:16:08,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:08,031 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:08,031 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 15:16:08,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:08,032 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 15:16:08,032 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 15:16:08,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,033 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:08,033 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:08,033 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 15:16:08,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,034 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 15:16:08,034 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 15:16:08,034 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 15:16:08,034 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,038 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:08,038 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:08,038 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 15:16:08,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:08,039 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 15:16:08,039 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 15:16:08,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,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-12-01 15:16:08,041 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:08,041 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 15:16:08,041 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:08,041 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 15:16:08,042 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 15:16:08,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,042 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,043 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:08,043 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:08,043 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 15:16:08,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:08,043 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 15:16:08,044 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 15:16:08,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,045 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,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-12-01 15:16:08,045 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:08,045 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 15:16:08,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:08,046 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 15:16:08,046 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 15:16:08,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,048 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:08,048 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:08,049 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 15:16:08,049 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,049 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 15:16:08,049 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 15:16:08,049 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 15:16:08,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,051 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:08,052 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:08,052 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 15:16:08,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:08,053 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 15:16:08,053 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 15:16:08,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,056 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:08,056 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:08,056 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 15:16:08,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,057 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 15:16:08,057 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 15:16:08,057 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 15:16:08,057 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,059 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-12-01 15:16:08,060 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:08,060 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:08,060 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-01 15:16:08,060 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:08,060 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:08,061 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:08,061 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,062 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,062 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:08,063 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:08,063 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-01 15:16:08,063 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:08,063 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:08,064 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:08,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:08,065 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:08,065 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-01 15:16:08,065 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,065 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 15:16:08,065 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:08,066 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 15:16:08,066 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,071 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,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-12-01 15:16:08,072 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:08,072 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-01 15:16:08,072 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:08,072 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:08,073 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:08,073 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,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-12-01 15:16:08,075 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:08,075 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-01 15:16:08,075 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:08,076 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:08,076 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:08,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,078 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:08,079 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:08,079 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-01 15:16:08,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:08,079 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:08,080 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:08,080 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:08,082 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:08,082 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-01 15:16:08,082 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:08,083 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:08,083 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:08,083 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,086 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,086 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:08,087 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:08,087 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-01 15:16:08,087 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,087 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 15:16:08,087 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:08,088 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 15:16:08,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,090 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,091 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:08,091 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:08,091 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-01 15:16:08,091 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:08,091 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:08,092 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:08,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,097 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:08,097 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:08,097 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-01 15:16:08,097 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,098 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 15:16:08,098 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:08,098 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 15:16:08,099 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,101 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-12-01 15:16:08,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-12-01 15:16:08,102 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:08,102 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 15:16:08,102 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:08,102 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 15:16:08,103 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 15:16:08,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,104 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:08,104 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:08,104 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 15:16:08,104 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:08,105 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 15:16:08,105 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 15:16:08,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,106 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:08,107 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:08,107 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 15:16:08,107 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,107 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 15:16:08,107 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 15:16:08,109 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-01 15:16:08,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:08,116 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:08,117 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 15:16:08,117 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:08,117 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 15:16:08,118 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 15:16:08,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,119 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:08,120 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:08,120 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 15:16:08,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:08,120 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 15:16:08,122 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 15:16:08,122 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:08,123 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:08,123 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 15:16:08,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:08,124 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 15:16:08,125 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 15:16:08,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,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-12-01 15:16:08,127 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:08,127 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 15:16:08,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:08,127 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 15:16:08,128 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 15:16:08,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:08,133 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:08,133 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 15:16:08,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,133 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 15:16:08,133 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 15:16:08,135 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-01 15:16:08,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,140 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:08,141 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:08,141 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 15:16:08,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:08,141 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 15:16:08,142 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 15:16:08,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:08,152 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:08,152 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 15:16:08,152 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,152 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 15:16:08,152 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 15:16:08,154 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-01 15:16:08,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,159 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,159 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-12-01 15:16:08,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:08,159 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:08,160 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 15:16:08,160 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:08,160 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:08,160 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:08,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,161 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,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-12-01 15:16:08,162 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:08,162 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 15:16:08,162 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:08,162 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:08,163 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:08,163 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,164 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:08,164 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:08,164 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 15:16:08,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,165 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 15:16:08,165 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:08,165 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 15:16:08,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,169 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:08,169 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:08,169 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 15:16:08,169 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:08,170 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:08,170 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:08,170 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:08,173 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:08,173 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 15:16:08,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:08,173 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:08,174 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:08,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,176 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,176 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:08,177 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:08,177 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 15:16:08,177 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:08,177 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:08,178 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:08,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:08,181 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:08,181 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 15:16:08,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:08,181 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:08,181 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:08,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:08,184 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:08,184 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 15:16:08,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,184 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 15:16:08,184 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:08,185 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 15:16:08,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:08,187 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:08,187 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 15:16:08,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:08,187 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:08,188 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 15:16:08,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,190 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:08,190 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:08,191 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 15:16:08,191 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,191 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 15:16:08,191 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 15:16:08,191 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 15:16:08,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,193 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,193 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-12-01 15:16:08,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-12-01 15:16:08,194 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:08,194 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 15:16:08,194 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:08,194 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-01 15:16:08,195 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 15:16:08,195 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,197 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:08,198 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:08,198 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 15:16:08,198 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:08,198 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-01 15:16:08,198 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 15:16:08,199 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:08,201 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:08,201 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 15:16:08,201 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,201 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 15:16:08,201 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-01 15:16:08,202 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-01 15:16:08,202 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,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-12-01 15:16:08,209 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:08,210 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 15:16:08,210 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:08,210 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-01 15:16:08,211 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 15:16:08,211 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:08,215 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:08,215 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 15:16:08,216 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:08,216 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-01 15:16:08,217 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 15:16:08,217 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,221 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:08,221 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:08,221 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 15:16:08,221 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:08,222 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-01 15:16:08,222 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 15:16:08,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,227 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,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-12-01 15:16:08,227 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:08,228 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 15:16:08,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:08,228 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-01 15:16:08,228 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 15:16:08,229 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,232 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:08,233 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:08,233 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 15:16:08,233 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,233 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 15:16:08,233 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-01 15:16:08,234 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-01 15:16:08,234 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,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-12-01 15:16:08,237 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:08,237 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 15:16:08,237 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:08,237 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-01 15:16:08,238 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 15:16:08,238 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,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-12-01 15:16:08,242 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 15:16:08,243 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 15:16:08,243 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:08,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:08,243 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 15:16:08,243 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-01 15:16:08,244 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-01 15:16:08,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:08,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:08,406 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2018-12-01 15:16:08,442 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 15:16:08,442 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 15:16:08,442 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 15:16:08,442 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 15:16:08,442 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-01 15:16:08,442 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 15:16:08,442 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 15:16:08,442 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 15:16:08,442 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1_false-unreach-call_false-termination.cil.c_Iteration10_Lasso [2018-12-01 15:16:08,443 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 15:16:08,443 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 15:16:08,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,751 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 15:16:08,752 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd0ad6d6-6f45-4215-bfdb-dd254d79619d/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-12-01 15:16:08,756 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 15:16:08,756 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 15:16:08,758 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 15:16:08,758 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___0~1=0} Honda state: {ULTIMATE.start_eval_~tmp___0~1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd0ad6d6-6f45-4215-bfdb-dd254d79619d/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-12-01 15:16:08,774 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 15:16:08,774 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 15:16:08,777 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 15:16:08,777 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~__retres1~3=0} Honda state: {ULTIMATE.start_main_~__retres1~3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd0ad6d6-6f45-4215-bfdb-dd254d79619d/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-12-01 15:16:08,803 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 15:16:08,804 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 15:16:08,806 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 15:16:08,806 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c_dr_st~0=0} Honda state: {~c_dr_st~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd0ad6d6-6f45-4215-bfdb-dd254d79619d/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-12-01 15:16:08,823 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 15:16:08,823 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd0ad6d6-6f45-4215-bfdb-dd254d79619d/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-12-01 15:16:08,840 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-01 15:16:08,841 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 15:16:08,857 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-01 15:16:08,858 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 15:16:08,859 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 15:16:08,859 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 15:16:08,859 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 15:16:08,859 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 15:16:08,859 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 15:16:08,859 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 15:16:08,859 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 15:16:08,859 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1_false-unreach-call_false-termination.cil.c_Iteration10_Lasso [2018-12-01 15:16:08,859 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 15:16:08,859 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 15:16:08,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:08,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:16:09,064 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 15:16:09,064 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 15:16:09,064 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:09,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:09,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:09,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:09,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:16:09,066 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 15:16:09,066 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 15:16:09,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:09,068 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:09,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:09,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:09,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:09,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:09,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:16:09,068 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 15:16:09,068 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:09,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:09,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:09,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:09,069 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:16:09,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:09,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:09,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:16:09,069 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 15:16:09,069 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:16:09,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:09,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-12-01 15:16:09,070 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:09,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:09,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:16:09,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:16:09,070 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 15:16:09,070 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 15:16:09,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:16:09,072 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:16:09,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:16:09,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:16:09,072 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 15:16:09,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:16:09,073 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-12-01 15:16:09,073 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-01 15:16:09,077 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 15:16:09,081 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-01 15:16:09,081 INFO L444 ModelExtractionUtils]: 6 out of 11 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 15:16:09,083 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 15:16:09,084 INFO L440 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2018-12-01 15:16:09,084 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 15:16:09,084 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~q_free~0) = 1*~q_free~0 Supporting invariants [1*~q_free~0 >= 0] [2018-12-01 15:16:09,087 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2018-12-01 15:16:09,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:16:09,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:16:09,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 15:16:09,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:16:09,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 15:16:09,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:16:09,170 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-12-01 15:16:09,171 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 229 states and 275 transitions. cyclomatic complexity: 50 Second operand 6 states. [2018-12-01 15:16:09,249 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 229 states and 275 transitions. cyclomatic complexity: 50. Second operand 6 states. Result 1087 states and 1324 transitions. Complement of second has 9 states. [2018-12-01 15:16:09,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-01 15:16:09,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-01 15:16:09,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 340 transitions. [2018-12-01 15:16:09,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 340 transitions. Stem has 16 letters. Loop has 15 letters. [2018-12-01 15:16:09,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 15:16:09,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 340 transitions. Stem has 31 letters. Loop has 15 letters. [2018-12-01 15:16:09,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 15:16:09,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 340 transitions. Stem has 16 letters. Loop has 30 letters. [2018-12-01 15:16:09,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 15:16:09,254 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1087 states and 1324 transitions. [2018-12-01 15:16:09,262 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 563 [2018-12-01 15:16:09,266 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1087 states to 892 states and 1084 transitions. [2018-12-01 15:16:09,266 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 646 [2018-12-01 15:16:09,266 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 650 [2018-12-01 15:16:09,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 892 states and 1084 transitions. [2018-12-01 15:16:09,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 15:16:09,266 INFO L705 BuchiCegarLoop]: Abstraction has 892 states and 1084 transitions. [2018-12-01 15:16:09,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states and 1084 transitions. [2018-12-01 15:16:09,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 659. [2018-12-01 15:16:09,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2018-12-01 15:16:09,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 802 transitions. [2018-12-01 15:16:09,273 INFO L728 BuchiCegarLoop]: Abstraction has 659 states and 802 transitions. [2018-12-01 15:16:09,273 INFO L608 BuchiCegarLoop]: Abstraction has 659 states and 802 transitions. [2018-12-01 15:16:09,273 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-01 15:16:09,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 659 states and 802 transitions. [2018-12-01 15:16:09,275 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 377 [2018-12-01 15:16:09,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 15:16:09,275 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 15:16:09,275 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:16:09,275 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:16:09,275 INFO L794 eck$LassoCheckResult]: Stem: 4150#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 4071#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 4072#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 4231#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 4229#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 4230#L313-1 assume !false; 4372#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 4371#L262 assume !false; 4370#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 4369#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 4368#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 4367#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 4366#L242 assume 0 != eval_~tmp___1~0; 4365#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 4364#L251 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 4363#L96 assume !(0 == ~p_dw_pc~0); 4174#L99 assume 1 == ~p_dw_pc~0; 4175#L109 [2018-12-01 15:16:09,276 INFO L796 eck$LassoCheckResult]: Loop: 4175#L109 ~q_buf_0~0 := do_write_p_#t~nondet2;havoc do_write_p_#t~nondet2;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 4083#L32 assume 1 == ~p_dw_pc~0; 4084#L33 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 4088#L43 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 4089#L44 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 4166#L74 assume 0 != immediate_notify_threads_~tmp~0;~p_dw_st~0 := 0; 4689#L74-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 4063#L51 assume !(1 == ~c_dr_pc~0); 4064#L51-2 is_do_read_c_triggered_~__retres1~1 := 0; 4682#L62 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 4683#L63 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 4598#L82 assume !(0 != immediate_notify_threads_~tmp___0~0); 4599#L82-2 ~q_write_ev~0 := 2; 4590#L107-1 assume !false; 4591#L108 assume !(0 == ~q_free~0); 4175#L109 [2018-12-01 15:16:09,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:16:09,276 INFO L82 PathProgramCache]: Analyzing trace with hash 560336285, now seen corresponding path program 1 times [2018-12-01 15:16:09,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:16:09,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:16:09,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:09,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:16:09,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:09,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:16:09,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:16:09,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:16:09,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:16:09,283 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 15:16:09,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:16:09,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1691430829, now seen corresponding path program 1 times [2018-12-01 15:16:09,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:16:09,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:16:09,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:09,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:16:09,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:09,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:16:09,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:16:09,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:16:09,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-01 15:16:09,291 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 15:16:09,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:16:09,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:16:09,292 INFO L87 Difference]: Start difference. First operand 659 states and 802 transitions. cyclomatic complexity: 155 Second operand 3 states. [2018-12-01 15:16:09,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:16:09,301 INFO L93 Difference]: Finished difference Result 372 states and 445 transitions. [2018-12-01 15:16:09,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:16:09,301 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 372 states and 445 transitions. [2018-12-01 15:16:09,302 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 233 [2018-12-01 15:16:09,303 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 372 states to 314 states and 376 transitions. [2018-12-01 15:16:09,304 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 311 [2018-12-01 15:16:09,304 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 314 [2018-12-01 15:16:09,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 314 states and 376 transitions. [2018-12-01 15:16:09,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 15:16:09,304 INFO L705 BuchiCegarLoop]: Abstraction has 314 states and 376 transitions. [2018-12-01 15:16:09,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states and 376 transitions. [2018-12-01 15:16:09,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 249. [2018-12-01 15:16:09,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-12-01 15:16:09,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 301 transitions. [2018-12-01 15:16:09,306 INFO L728 BuchiCegarLoop]: Abstraction has 249 states and 301 transitions. [2018-12-01 15:16:09,307 INFO L608 BuchiCegarLoop]: Abstraction has 249 states and 301 transitions. [2018-12-01 15:16:09,307 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-12-01 15:16:09,307 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 249 states and 301 transitions. [2018-12-01 15:16:09,307 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 206 [2018-12-01 15:16:09,307 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 15:16:09,307 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 15:16:09,308 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:16:09,308 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:16:09,308 INFO L794 eck$LassoCheckResult]: Stem: 5135#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 5097#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 5098#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 5176#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 5174#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 5175#L313-1 assume !false; 5218#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 5215#L262 assume !false; 5213#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5211#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 5209#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5207#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 5205#L242 assume 0 != eval_~tmp___1~0; 5200#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 5166#L251 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 5167#L96 assume 0 == ~p_dw_pc~0; 5199#L107-1 assume !false; 5156#L108 assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 5125#L247 [2018-12-01 15:16:09,308 INFO L796 eck$LassoCheckResult]: Loop: 5125#L247 assume !(0 == ~c_dr_st~0); 5100#L262 assume !false; 5150#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5151#L214 assume !(0 == ~p_dw_st~0); 5163#L218 assume 0 == ~c_dr_st~0;exists_runnable_thread_~__retres1~2 := 1; 5112#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5113#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 5127#L242 assume 0 != eval_~tmp___1~0; 5124#L242-1 assume !(0 == ~p_dw_st~0); 5125#L247 [2018-12-01 15:16:09,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:16:09,308 INFO L82 PathProgramCache]: Analyzing trace with hash 190554158, now seen corresponding path program 1 times [2018-12-01 15:16:09,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:16:09,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:16:09,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:09,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:16:09,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:09,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:16:09,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:16:09,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:16:09,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-01 15:16:09,321 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 15:16:09,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:16:09,321 INFO L82 PathProgramCache]: Analyzing trace with hash 313858188, now seen corresponding path program 1 times [2018-12-01 15:16:09,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:16:09,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:16:09,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:09,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:16:09,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:09,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:16:09,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:16:09,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:16:09,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-01 15:16:09,325 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 15:16:09,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:16:09,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:16:09,325 INFO L87 Difference]: Start difference. First operand 249 states and 301 transitions. cyclomatic complexity: 54 Second operand 3 states. [2018-12-01 15:16:09,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:16:09,336 INFO L93 Difference]: Finished difference Result 308 states and 364 transitions. [2018-12-01 15:16:09,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:16:09,336 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 308 states and 364 transitions. [2018-12-01 15:16:09,337 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 258 [2018-12-01 15:16:09,338 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 308 states to 308 states and 364 transitions. [2018-12-01 15:16:09,338 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 308 [2018-12-01 15:16:09,338 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 308 [2018-12-01 15:16:09,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 308 states and 364 transitions. [2018-12-01 15:16:09,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 15:16:09,338 INFO L705 BuchiCegarLoop]: Abstraction has 308 states and 364 transitions. [2018-12-01 15:16:09,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states and 364 transitions. [2018-12-01 15:16:09,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 218. [2018-12-01 15:16:09,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-12-01 15:16:09,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 258 transitions. [2018-12-01 15:16:09,340 INFO L728 BuchiCegarLoop]: Abstraction has 218 states and 258 transitions. [2018-12-01 15:16:09,340 INFO L608 BuchiCegarLoop]: Abstraction has 218 states and 258 transitions. [2018-12-01 15:16:09,340 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-12-01 15:16:09,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 218 states and 258 transitions. [2018-12-01 15:16:09,341 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 168 [2018-12-01 15:16:09,341 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 15:16:09,341 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 15:16:09,341 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:16:09,341 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:16:09,342 INFO L794 eck$LassoCheckResult]: Stem: 5701#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 5661#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 5662#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 5737#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 5735#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 5736#L313-1 assume !false; 5803#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 5801#L262 assume !false; 5799#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5796#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 5794#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5791#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 5789#L242 assume 0 != eval_~tmp___1~0; 5788#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 5782#L251 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 5781#L96 assume 0 == ~p_dw_pc~0; 5777#L107-1 assume !false; 5748#L108 assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 5744#L247 [2018-12-01 15:16:09,342 INFO L796 eck$LassoCheckResult]: Loop: 5744#L247 assume 0 == ~c_dr_st~0;eval_~tmp___0~1 := eval_#t~nondet5;havoc eval_#t~nondet5; 5663#L266 assume !(0 != eval_~tmp___0~1); 5664#L262 assume !false; 5776#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5774#L214 assume !(0 == ~p_dw_st~0); 5772#L218 assume 0 == ~c_dr_st~0;exists_runnable_thread_~__retres1~2 := 1; 5770#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5768#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 5764#L242 assume 0 != eval_~tmp___1~0; 5749#L242-1 assume !(0 == ~p_dw_st~0); 5744#L247 [2018-12-01 15:16:09,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:16:09,342 INFO L82 PathProgramCache]: Analyzing trace with hash 190554158, now seen corresponding path program 2 times [2018-12-01 15:16:09,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:16:09,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:16:09,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:09,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:16:09,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:09,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:16:09,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:16:09,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:16:09,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-01 15:16:09,350 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 15:16:09,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:16:09,350 INFO L82 PathProgramCache]: Analyzing trace with hash -750519281, now seen corresponding path program 1 times [2018-12-01 15:16:09,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:16:09,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:16:09,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:09,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 15:16:09,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:09,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:16:09,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:16:09,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:16:09,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:16:09,382 INFO L87 Difference]: Start difference. First operand 218 states and 258 transitions. cyclomatic complexity: 43 Second operand 3 states. [2018-12-01 15:16:09,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:16:09,389 INFO L93 Difference]: Finished difference Result 241 states and 282 transitions. [2018-12-01 15:16:09,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:16:09,389 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 241 states and 282 transitions. [2018-12-01 15:16:09,390 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 190 [2018-12-01 15:16:09,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 241 states to 240 states and 281 transitions. [2018-12-01 15:16:09,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 240 [2018-12-01 15:16:09,391 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 240 [2018-12-01 15:16:09,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 240 states and 281 transitions. [2018-12-01 15:16:09,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 15:16:09,391 INFO L705 BuchiCegarLoop]: Abstraction has 240 states and 281 transitions. [2018-12-01 15:16:09,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states and 281 transitions. [2018-12-01 15:16:09,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 217. [2018-12-01 15:16:09,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-12-01 15:16:09,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 256 transitions. [2018-12-01 15:16:09,393 INFO L728 BuchiCegarLoop]: Abstraction has 217 states and 256 transitions. [2018-12-01 15:16:09,393 INFO L608 BuchiCegarLoop]: Abstraction has 217 states and 256 transitions. [2018-12-01 15:16:09,393 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-12-01 15:16:09,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 217 states and 256 transitions. [2018-12-01 15:16:09,394 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 168 [2018-12-01 15:16:09,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 15:16:09,394 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 15:16:09,394 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-12-01 15:16:09,394 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:16:09,394 INFO L794 eck$LassoCheckResult]: Stem: 6168#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 6127#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 6128#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 6210#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 6209#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 6199#L313-1 assume !false; 6149#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 6150#L262 assume !false; 6184#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 6185#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 6260#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 6259#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 6158#L242 assume 0 != eval_~tmp___1~0; 6159#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 6257#L251 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 6256#L96 assume !(0 == ~p_dw_pc~0); 6182#L99 assume 1 == ~p_dw_pc~0; 6144#L109 ~q_buf_0~0 := do_write_p_#t~nondet2;havoc do_write_p_#t~nondet2;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 6145#L32 assume 1 == ~p_dw_pc~0; 6174#L33 assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0 := 1; 6175#L43 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 6250#L44 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 6247#L74 assume !(0 != immediate_notify_threads_~tmp~0); 6191#L74-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 6124#L51 assume !(1 == ~c_dr_pc~0); 6125#L51-2 is_do_read_c_triggered_~__retres1~1 := 0; 6239#L62 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 6236#L63 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 6232#L82 assume !(0 != immediate_notify_threads_~tmp___0~0); 6228#L82-2 ~q_write_ev~0 := 2; 6224#L107-1 assume !false; 6220#L108 assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 6217#L247 [2018-12-01 15:16:09,394 INFO L796 eck$LassoCheckResult]: Loop: 6217#L247 assume 0 == ~c_dr_st~0;eval_~tmp___0~1 := eval_#t~nondet5;havoc eval_#t~nondet5; 6129#L266 assume !(0 != eval_~tmp___0~1); 6130#L262 assume !false; 6242#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 6240#L214 assume !(0 == ~p_dw_st~0); 6237#L218 assume 0 == ~c_dr_st~0;exists_runnable_thread_~__retres1~2 := 1; 6233#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 6229#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 6225#L242 assume 0 != eval_~tmp___1~0; 6221#L242-1 assume !(0 == ~p_dw_st~0); 6217#L247 [2018-12-01 15:16:09,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:16:09,395 INFO L82 PathProgramCache]: Analyzing trace with hash -2034026126, now seen corresponding path program 1 times [2018-12-01 15:16:09,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:16:09,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:16:09,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:09,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:16:09,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:09,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:16:09,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:16:09,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:16:09,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:16:09,407 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 15:16:09,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:16:09,407 INFO L82 PathProgramCache]: Analyzing trace with hash -750519281, now seen corresponding path program 2 times [2018-12-01 15:16:09,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:16:09,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:16:09,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:09,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:16:09,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:09,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:16:09,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:16:09,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:16:09,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:16:09,430 INFO L87 Difference]: Start difference. First operand 217 states and 256 transitions. cyclomatic complexity: 42 Second operand 3 states. [2018-12-01 15:16:09,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:16:09,438 INFO L93 Difference]: Finished difference Result 210 states and 244 transitions. [2018-12-01 15:16:09,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:16:09,438 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 210 states and 244 transitions. [2018-12-01 15:16:09,439 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 168 [2018-12-01 15:16:09,440 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 210 states to 210 states and 244 transitions. [2018-12-01 15:16:09,440 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 210 [2018-12-01 15:16:09,440 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 210 [2018-12-01 15:16:09,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 210 states and 244 transitions. [2018-12-01 15:16:09,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 15:16:09,441 INFO L705 BuchiCegarLoop]: Abstraction has 210 states and 244 transitions. [2018-12-01 15:16:09,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states and 244 transitions. [2018-12-01 15:16:09,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2018-12-01 15:16:09,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-12-01 15:16:09,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 244 transitions. [2018-12-01 15:16:09,444 INFO L728 BuchiCegarLoop]: Abstraction has 210 states and 244 transitions. [2018-12-01 15:16:09,444 INFO L608 BuchiCegarLoop]: Abstraction has 210 states and 244 transitions. [2018-12-01 15:16:09,444 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-12-01 15:16:09,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 210 states and 244 transitions. [2018-12-01 15:16:09,445 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 168 [2018-12-01 15:16:09,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 15:16:09,445 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 15:16:09,445 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [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] [2018-12-01 15:16:09,446 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:16:09,446 INFO L794 eck$LassoCheckResult]: Stem: 6599#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 6560#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 6561#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 6642#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 6640#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 6641#L313-1 assume !false; 6681#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 6679#L262 assume !false; 6677#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 6675#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 6670#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 6666#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 6662#L242 assume 0 != eval_~tmp___1~0; 6659#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 6633#L251 assume 0 != eval_~tmp~1;~p_dw_st~0 := 1;havoc do_write_p_#t~nondet2; 6625#L96 assume 0 == ~p_dw_pc~0; 6626#L107-1 assume !false; 6651#L108 assume !(0 == ~q_free~0); 6577#L109 ~q_buf_0~0 := do_write_p_#t~nondet2;havoc do_write_p_#t~nondet2;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1;havoc immediate_notify_threads_#t~ret0, immediate_notify_threads_#t~ret1, immediate_notify_threads_~tmp~0, immediate_notify_threads_~tmp___0~0;havoc immediate_notify_threads_~tmp~0;havoc immediate_notify_threads_~tmp___0~0;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 6567#L32 assume !(1 == ~p_dw_pc~0); 6568#L32-2 is_do_write_p_triggered_~__retres1~0 := 0; 6569#L43 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 6570#L44 immediate_notify_threads_#t~ret0 := is_do_write_p_triggered_#res;immediate_notify_threads_~tmp~0 := immediate_notify_threads_#t~ret0;havoc immediate_notify_threads_#t~ret0; 6608#L74 assume !(0 != immediate_notify_threads_~tmp~0); 6594#L74-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 6557#L51 assume !(1 == ~c_dr_pc~0); 6558#L51-2 is_do_read_c_triggered_~__retres1~1 := 0; 6692#L62 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 6690#L63 immediate_notify_threads_#t~ret1 := is_do_read_c_triggered_#res;immediate_notify_threads_~tmp___0~0 := immediate_notify_threads_#t~ret1;havoc immediate_notify_threads_#t~ret1; 6688#L82 assume !(0 != immediate_notify_threads_~tmp___0~0); 6687#L82-2 ~q_write_ev~0 := 2; 6686#L107-1 assume !false; 6671#L108 assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; 6667#L247 [2018-12-01 15:16:09,446 INFO L796 eck$LassoCheckResult]: Loop: 6667#L247 assume 0 == ~c_dr_st~0;eval_~tmp___0~1 := eval_#t~nondet5;havoc eval_#t~nondet5; 6562#L266 assume !(0 != eval_~tmp___0~1); 6563#L262 assume !false; 6615#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 6616#L214 assume !(0 == ~p_dw_st~0); 6693#L218 assume 0 == ~c_dr_st~0;exists_runnable_thread_~__retres1~2 := 1; 6685#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 6612#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 6592#L242 assume 0 != eval_~tmp___1~0; 6593#L242-1 assume !(0 == ~p_dw_st~0); 6667#L247 [2018-12-01 15:16:09,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:16:09,446 INFO L82 PathProgramCache]: Analyzing trace with hash 825120445, now seen corresponding path program 1 times [2018-12-01 15:16:09,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:16:09,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:16:09,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:09,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 15:16:09,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:09,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:16:09,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:16:09,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:16:09,455 INFO L82 PathProgramCache]: Analyzing trace with hash -750519281, now seen corresponding path program 3 times [2018-12-01 15:16:09,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:16:09,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:16:09,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:09,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:16:09,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:09,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:16:09,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:16:09,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:16:09,458 INFO L82 PathProgramCache]: Analyzing trace with hash 250746827, now seen corresponding path program 1 times [2018-12-01 15:16:09,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:16:09,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:16:09,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:09,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 15:16:09,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:16:09,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:16:09,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:16:09,654 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 103 [2018-12-01 15:16:09,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.12 03:16:09 BoogieIcfgContainer [2018-12-01 15:16:09,703 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-01 15:16:09,704 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 15:16:09,704 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 15:16:09,704 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 15:16:09,704 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:16:05" (3/4) ... [2018-12-01 15:16:09,707 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-12-01 15:16:09,749 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_fd0ad6d6-6f45-4215-bfdb-dd254d79619d/bin-2019/uautomizer/witness.graphml [2018-12-01 15:16:09,749 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 15:16:09,750 INFO L168 Benchmark]: Toolchain (without parser) took 4390.15 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 286.3 MB). Free memory was 956.0 MB in the beginning and 933.1 MB in the end (delta: 22.9 MB). Peak memory consumption was 309.2 MB. Max. memory is 11.5 GB. [2018-12-01 15:16:09,751 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 15:16:09,751 INFO L168 Benchmark]: CACSL2BoogieTranslator took 156.26 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 939.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-01 15:16:09,751 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.68 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -167.7 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2018-12-01 15:16:09,751 INFO L168 Benchmark]: Boogie Preprocessor took 15.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-01 15:16:09,751 INFO L168 Benchmark]: RCFGBuilder took 247.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2018-12-01 15:16:09,751 INFO L168 Benchmark]: BuchiAutomizer took 3868.60 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 173.0 MB). Free memory was 1.1 GB in the beginning and 942.4 MB in the end (delta: 135.9 MB). Peak memory consumption was 308.9 MB. Max. memory is 11.5 GB. [2018-12-01 15:16:09,752 INFO L168 Benchmark]: Witness Printer took 45.67 ms. Allocated memory is still 1.3 GB. Free memory was 942.4 MB in the beginning and 933.1 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. [2018-12-01 15:16:09,753 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 156.26 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 939.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 53.68 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -167.7 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 247.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3868.60 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 173.0 MB). Free memory was 1.1 GB in the beginning and 942.4 MB in the end (delta: 135.9 MB). Peak memory consumption was 308.9 MB. Max. memory is 11.5 GB. * Witness Printer took 45.67 ms. Allocated memory is still 1.3 GB. Free memory was 942.4 MB in the beginning and 933.1 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (13 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function q_free and consists of 6 locations. 13 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 210 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.8s and 15 iterations. TraceHistogramMax:2. Analysis of lassos took 3.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 11. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 848 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 659 states and ocurred in iteration 10. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1747 SDtfs, 1631 SDslu, 1732 SDs, 0 SdLazy, 203 SolverSat, 57 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI6 SFLT0 conc1 concLT0 SILN2 SILU0 SILI4 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital70 mio100 ax100 hnf100 lsp18 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq210 hnf86 smp100 dnf118 smp100 tf105 neg92 sie115 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 12ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 262]: 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 {p_last_write=4, c_dr_i=1, c_dr_pc=0, a_t=0, \result=0, \result=0, c_num_read=0, tmp=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3f0ac661=0, c_dr_st=0, kernel_st=1, q_read_ev=2, p_dw_i=1, tmp___0=0, tmp___1=1, q_write_ev=2, __retres1=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1ff479dc=0, p_dw_pc=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@55f2ad40=0, tmp=0, q_free=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6e724a2c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@61826e07=0, __retres1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@13497bbb=0, p_dw_st=2, \result=0, tmp___0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@54fac792=0, tmp=0, c_last_read=0, __retres1=0, p_num_write=1, q_buf_0=4, __retres1=0, \result=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 237]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L14] int q_buf_0 ; [L15] int q_free ; [L16] int q_read_ev ; [L17] int q_write_ev ; [L18] int p_num_write ; [L19] int p_last_write ; [L20] int p_dw_st ; [L21] int p_dw_pc ; [L22] int p_dw_i ; [L23] int c_num_read ; [L24] int c_last_read ; [L25] int c_dr_st ; [L26] int c_dr_pc ; [L27] int c_dr_i ; [L134] static int a_t ; [L350] int __retres1 ; [L336] q_free = 1 [L337] q_write_ev = 2 [L338] q_read_ev = q_write_ev [L339] p_num_write = 0 [L340] p_dw_pc = 0 [L341] p_dw_i = 1 [L342] c_num_read = 0 [L343] c_dr_pc = 0 [L344] c_dr_i = 1 [L304] int kernel_st ; [L305] int tmp ; [L309] kernel_st = 0 [L196] COND TRUE (int )p_dw_i == 1 [L197] p_dw_st = 0 [L201] COND TRUE (int )c_dr_i == 1 [L202] c_dr_st = 0 [L313] COND TRUE 1 [L316] kernel_st = 1 [L231] int tmp ; [L232] int tmp___0 ; [L233] int tmp___1 ; [L237] COND TRUE 1 [L211] int __retres1 ; [L214] COND TRUE (int )p_dw_st == 0 [L215] __retres1 = 1 [L227] return (__retres1); [L240] tmp___1 = exists_runnable_thread() [L242] COND TRUE \read(tmp___1) [L247] COND TRUE (int )p_dw_st == 0 [L249] tmp = __VERIFIER_nondet_int() [L251] COND TRUE \read(tmp) [L253] p_dw_st = 1 [L96] COND TRUE (int )p_dw_pc == 0 [L107] COND TRUE 1 [L109] COND FALSE !((int )q_free == 0) [L119] q_buf_0 = __VERIFIER_nondet_int() [L120] p_last_write = q_buf_0 [L121] p_num_write += 1 [L122] q_free = 0 [L123] q_write_ev = 1 [L67] int tmp ; [L68] int tmp___0 ; [L29] int __retres1 ; [L32] COND FALSE !((int )p_dw_pc == 1) [L42] __retres1 = 0 [L44] return (__retres1); [L72] tmp = is_do_write_p_triggered() [L74] COND FALSE !(\read(tmp)) [L48] int __retres1 ; [L51] COND FALSE !((int )c_dr_pc == 1) [L61] __retres1 = 0 [L63] return (__retres1); [L80] tmp___0 = is_do_read_c_triggered() [L82] COND FALSE !(\read(tmp___0)) [L125] q_write_ev = 2 [L107] COND TRUE 1 [L109] COND TRUE (int )q_free == 0 [L110] p_dw_st = 2 [L111] p_dw_pc = 1 Loop: [L262] COND TRUE (int )c_dr_st == 0 [L264] tmp___0 = __VERIFIER_nondet_int() [L266] COND FALSE !(\read(tmp___0)) [L237] COND TRUE 1 [L211] int __retres1 ; [L214] COND FALSE !((int )p_dw_st == 0) [L218] COND TRUE (int )c_dr_st == 0 [L219] __retres1 = 1 [L227] return (__retres1); [L240] tmp___1 = exists_runnable_thread() [L242] COND TRUE \read(tmp___1) [L247] COND FALSE !((int )p_dw_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...