./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 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_1c741429-5b35-4028-bd31-94d9ed4e351b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1c741429-5b35-4028-bd31-94d9ed4e351b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1c741429-5b35-4028-bd31-94d9ed4e351b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1c741429-5b35-4028-bd31-94d9ed4e351b/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_1c741429-5b35-4028-bd31-94d9ed4e351b/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1c741429-5b35-4028-bd31-94d9ed4e351b/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-0cd3be1 [2018-11-28 12:25:40,720 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 12:25:40,721 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 12:25:40,727 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 12:25:40,727 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 12:25:40,728 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 12:25:40,729 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 12:25:40,730 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 12:25:40,731 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 12:25:40,731 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 12:25:40,732 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 12:25:40,732 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 12:25:40,733 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 12:25:40,733 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 12:25:40,734 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 12:25:40,735 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 12:25:40,735 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 12:25:40,736 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 12:25:40,738 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 12:25:40,739 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 12:25:40,740 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 12:25:40,740 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 12:25:40,742 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 12:25:40,742 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 12:25:40,742 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 12:25:40,743 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 12:25:40,744 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 12:25:40,744 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 12:25:40,745 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 12:25:40,746 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 12:25:40,746 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 12:25:40,746 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 12:25:40,746 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 12:25:40,746 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 12:25:40,747 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 12:25:40,747 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 12:25:40,747 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1c741429-5b35-4028-bd31-94d9ed4e351b/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 12:25:40,755 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 12:25:40,755 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 12:25:40,756 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 12:25:40,756 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 12:25:40,756 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 12:25:40,756 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 12:25:40,757 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 12:25:40,757 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 12:25:40,757 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 12:25:40,757 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 12:25:40,757 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 12:25:40,757 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 12:25:40,757 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 12:25:40,758 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 12:25:40,758 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 12:25:40,758 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 12:25:40,758 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 12:25:40,758 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 12:25:40,758 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 12:25:40,758 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 12:25:40,758 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 12:25:40,759 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 12:25:40,759 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 12:25:40,759 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 12:25:40,759 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 12:25:40,759 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 12:25:40,759 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 12:25:40,759 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 12:25:40,760 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 12:25:40,760 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 12:25:40,760 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 12:25:40,760 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 12:25:40,761 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_1c741429-5b35-4028-bd31-94d9ed4e351b/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-11-28 12:25:40,785 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 12:25:40,794 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 12:25:40,797 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 12:25:40,798 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 12:25:40,798 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 12:25:40,799 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1c741429-5b35-4028-bd31-94d9ed4e351b/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/pc_sfifo_1_false-unreach-call_false-termination.cil.c [2018-11-28 12:25:40,845 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1c741429-5b35-4028-bd31-94d9ed4e351b/bin-2019/uautomizer/data/11c6c5208/459b0cf689294be5a10e794328760471/FLAG6b1ed322a [2018-11-28 12:25:41,190 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 12:25:41,190 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1c741429-5b35-4028-bd31-94d9ed4e351b/sv-benchmarks/c/systemc/pc_sfifo_1_false-unreach-call_false-termination.cil.c [2018-11-28 12:25:41,197 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1c741429-5b35-4028-bd31-94d9ed4e351b/bin-2019/uautomizer/data/11c6c5208/459b0cf689294be5a10e794328760471/FLAG6b1ed322a [2018-11-28 12:25:41,208 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1c741429-5b35-4028-bd31-94d9ed4e351b/bin-2019/uautomizer/data/11c6c5208/459b0cf689294be5a10e794328760471 [2018-11-28 12:25:41,211 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 12:25:41,212 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 12:25:41,212 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 12:25:41,212 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 12:25:41,215 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 12:25:41,216 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:25:41" (1/1) ... [2018-11-28 12:25:41,218 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23c1b638 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:41, skipping insertion in model container [2018-11-28 12:25:41,218 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:25:41" (1/1) ... [2018-11-28 12:25:41,224 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 12:25:41,243 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 12:25:41,372 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:25:41,375 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 12:25:41,398 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:25:41,409 INFO L195 MainTranslator]: Completed translation [2018-11-28 12:25:41,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:41 WrapperNode [2018-11-28 12:25:41,409 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 12:25:41,410 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 12:25:41,410 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 12:25:41,410 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 12:25:41,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:41" (1/1) ... [2018-11-28 12:25:41,419 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:41" (1/1) ... [2018-11-28 12:25:41,473 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 12:25:41,473 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 12:25:41,473 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 12:25:41,474 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 12:25:41,480 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:41" (1/1) ... [2018-11-28 12:25:41,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:41" (1/1) ... [2018-11-28 12:25:41,481 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:41" (1/1) ... [2018-11-28 12:25:41,481 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:41" (1/1) ... [2018-11-28 12:25:41,484 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:41" (1/1) ... [2018-11-28 12:25:41,490 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:41" (1/1) ... [2018-11-28 12:25:41,491 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:41" (1/1) ... [2018-11-28 12:25:41,493 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 12:25:41,493 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 12:25:41,493 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 12:25:41,493 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 12:25:41,494 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1c741429-5b35-4028-bd31-94d9ed4e351b/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:25:41,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 12:25:41,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 12:25:41,790 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 12:25:41,790 INFO L280 CfgBuilder]: Removed 44 assue(true) statements. [2018-11-28 12:25:41,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:25:41 BoogieIcfgContainer [2018-11-28 12:25:41,790 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 12:25:41,791 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 12:25:41,791 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 12:25:41,793 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 12:25:41,794 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:25:41,794 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 12:25:41" (1/3) ... [2018-11-28 12:25:41,795 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@74aaf815 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 12:25:41, skipping insertion in model container [2018-11-28 12:25:41,795 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:25:41,795 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:25:41" (2/3) ... [2018-11-28 12:25:41,796 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@74aaf815 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 12:25:41, skipping insertion in model container [2018-11-28 12:25:41,796 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:25:41,796 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:25:41" (3/3) ... [2018-11-28 12:25:41,797 INFO L375 chiAutomizerObserver]: Analyzing ICFG pc_sfifo_1_false-unreach-call_false-termination.cil.c [2018-11-28 12:25:41,836 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 12:25:41,836 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 12:25:41,836 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 12:25:41,836 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 12:25:41,836 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 12:25:41,836 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 12:25:41,837 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 12:25:41,837 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 12:25:41,837 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 12:25:41,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states. [2018-11-28 12:25:41,865 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2018-11-28 12:25:41,865 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:25:41,865 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:25:41,871 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 12:25:41,871 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:25:41,871 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 12:25:41,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states. [2018-11-28 12:25:41,874 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2018-11-28 12:25:41,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:25:41,875 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:25:41,875 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 12:25:41,875 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:25:41,880 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-11-28 12:25:41,881 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-11-28 12:25:41,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:41,885 INFO L82 PathProgramCache]: Analyzing trace with hash 28692871, now seen corresponding path program 1 times [2018-11-28 12:25:41,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:41,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:41,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:41,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:41,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:41,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:41,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:41,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:25:41,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:25:41,978 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:25:41,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:41,978 INFO L82 PathProgramCache]: Analyzing trace with hash -778318386, now seen corresponding path program 1 times [2018-11-28 12:25:41,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:41,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:41,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:41,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:41,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:41,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:41,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:41,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:25:41,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 12:25:41,984 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:25:41,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:25:41,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:25:41,994 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 3 states. [2018-11-28 12:25:42,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:42,011 INFO L93 Difference]: Finished difference Result 75 states and 103 transitions. [2018-11-28 12:25:42,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:25:42,012 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 103 transitions. [2018-11-28 12:25:42,014 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2018-11-28 12:25:42,018 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 68 states and 96 transitions. [2018-11-28 12:25:42,019 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2018-11-28 12:25:42,020 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2018-11-28 12:25:42,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 96 transitions. [2018-11-28 12:25:42,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:25:42,021 INFO L705 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2018-11-28 12:25:42,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 96 transitions. [2018-11-28 12:25:42,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-11-28 12:25:42,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-28 12:25:42,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2018-11-28 12:25:42,043 INFO L728 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2018-11-28 12:25:42,043 INFO L608 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2018-11-28 12:25:42,043 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 12:25:42,043 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 96 transitions. [2018-11-28 12:25:42,044 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2018-11-28 12:25:42,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:25:42,045 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:25:42,045 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 12:25:42,045 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:25:42,045 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-11-28 12:25:42,046 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-11-28 12:25:42,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:42,046 INFO L82 PathProgramCache]: Analyzing trace with hash 28692809, now seen corresponding path program 1 times [2018-11-28 12:25:42,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:42,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:42,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:42,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:42,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:42,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:42,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:42,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:25:42,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 12:25:42,073 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:25:42,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:42,073 INFO L82 PathProgramCache]: Analyzing trace with hash -852169887, now seen corresponding path program 1 times [2018-11-28 12:25:42,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:42,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:42,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:42,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:42,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:42,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:42,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:42,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:25:42,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:25:42,100 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:25:42,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:25:42,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:25:42,101 INFO L87 Difference]: Start difference. First operand 68 states and 96 transitions. cyclomatic complexity: 29 Second operand 3 states. [2018-11-28 12:25:42,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:42,108 INFO L93 Difference]: Finished difference Result 68 states and 95 transitions. [2018-11-28 12:25:42,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:25:42,108 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 95 transitions. [2018-11-28 12:25:42,109 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2018-11-28 12:25:42,110 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 68 states and 95 transitions. [2018-11-28 12:25:42,110 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2018-11-28 12:25:42,110 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2018-11-28 12:25:42,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 95 transitions. [2018-11-28 12:25:42,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:25:42,111 INFO L705 BuchiCegarLoop]: Abstraction has 68 states and 95 transitions. [2018-11-28 12:25:42,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 95 transitions. [2018-11-28 12:25:42,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-11-28 12:25:42,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-28 12:25:42,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 95 transitions. [2018-11-28 12:25:42,113 INFO L728 BuchiCegarLoop]: Abstraction has 68 states and 95 transitions. [2018-11-28 12:25:42,113 INFO L608 BuchiCegarLoop]: Abstraction has 68 states and 95 transitions. [2018-11-28 12:25:42,114 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 12:25:42,114 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 95 transitions. [2018-11-28 12:25:42,114 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2018-11-28 12:25:42,114 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:25:42,114 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:25:42,115 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 12:25:42,115 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:25:42,115 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-11-28 12:25:42,115 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-11-28 12:25:42,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:42,115 INFO L82 PathProgramCache]: Analyzing trace with hash 28692807, now seen corresponding path program 1 times [2018-11-28 12:25:42,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:42,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:42,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:42,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:42,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:42,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:42,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:42,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:42,135 INFO L82 PathProgramCache]: Analyzing trace with hash -852169887, now seen corresponding path program 2 times [2018-11-28 12:25:42,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:42,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:42,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:42,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:42,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:42,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:42,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:42,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:25:42,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:25:42,175 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:25:42,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:25:42,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:25:42,175 INFO L87 Difference]: Start difference. First operand 68 states and 95 transitions. cyclomatic complexity: 28 Second operand 5 states. [2018-11-28 12:25:42,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:42,230 INFO L93 Difference]: Finished difference Result 134 states and 185 transitions. [2018-11-28 12:25:42,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 12:25:42,231 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 185 transitions. [2018-11-28 12:25:42,232 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 129 [2018-11-28 12:25:42,233 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 134 states and 185 transitions. [2018-11-28 12:25:42,234 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 134 [2018-11-28 12:25:42,234 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 134 [2018-11-28 12:25:42,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 185 transitions. [2018-11-28 12:25:42,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:25:42,235 INFO L705 BuchiCegarLoop]: Abstraction has 134 states and 185 transitions. [2018-11-28 12:25:42,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states and 185 transitions. [2018-11-28 12:25:42,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 71. [2018-11-28 12:25:42,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-28 12:25:42,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 98 transitions. [2018-11-28 12:25:42,240 INFO L728 BuchiCegarLoop]: Abstraction has 71 states and 98 transitions. [2018-11-28 12:25:42,240 INFO L608 BuchiCegarLoop]: Abstraction has 71 states and 98 transitions. [2018-11-28 12:25:42,240 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 12:25:42,241 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 98 transitions. [2018-11-28 12:25:42,241 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2018-11-28 12:25:42,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:25:42,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:25:42,242 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 12:25:42,242 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:25:42,242 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-11-28 12:25:42,242 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-11-28 12:25:42,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:42,242 INFO L82 PathProgramCache]: Analyzing trace with hash 28692807, now seen corresponding path program 2 times [2018-11-28 12:25:42,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:42,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:42,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:42,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:25:42,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:42,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:42,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:42,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:42,257 INFO L82 PathProgramCache]: Analyzing trace with hash 6171900, now seen corresponding path program 1 times [2018-11-28 12:25:42,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:42,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:42,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:42,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:25:42,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:42,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:42,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:42,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:25:42,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:25:42,274 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:25:42,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:25:42,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:25:42,275 INFO L87 Difference]: Start difference. First operand 71 states and 98 transitions. cyclomatic complexity: 28 Second operand 3 states. [2018-11-28 12:25:42,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:42,295 INFO L93 Difference]: Finished difference Result 116 states and 156 transitions. [2018-11-28 12:25:42,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:25:42,296 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 156 transitions. [2018-11-28 12:25:42,296 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 109 [2018-11-28 12:25:42,297 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 116 states and 156 transitions. [2018-11-28 12:25:42,297 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2018-11-28 12:25:42,298 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2018-11-28 12:25:42,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 156 transitions. [2018-11-28 12:25:42,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:25:42,299 INFO L705 BuchiCegarLoop]: Abstraction has 116 states and 156 transitions. [2018-11-28 12:25:42,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 156 transitions. [2018-11-28 12:25:42,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 99. [2018-11-28 12:25:42,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-28 12:25:42,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 132 transitions. [2018-11-28 12:25:42,303 INFO L728 BuchiCegarLoop]: Abstraction has 99 states and 132 transitions. [2018-11-28 12:25:42,303 INFO L608 BuchiCegarLoop]: Abstraction has 99 states and 132 transitions. [2018-11-28 12:25:42,303 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 12:25:42,304 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 132 transitions. [2018-11-28 12:25:42,304 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2018-11-28 12:25:42,304 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:25:42,305 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:25:42,305 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:25:42,305 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-11-28 12:25:42,305 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-11-28 12:25:42,306 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-11-28 12:25:42,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:42,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1803984585, now seen corresponding path program 1 times [2018-11-28 12:25:42,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:42,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:42,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:42,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:42,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:42,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:42,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:42,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:42,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1836630604, now seen corresponding path program 1 times [2018-11-28 12:25:42,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:42,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:42,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:42,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:42,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:42,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:42,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:42,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:25:42,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:25:42,339 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:25:42,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:25:42,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:25:42,339 INFO L87 Difference]: Start difference. First operand 99 states and 132 transitions. cyclomatic complexity: 34 Second operand 3 states. [2018-11-28 12:25:42,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:42,359 INFO L93 Difference]: Finished difference Result 116 states and 154 transitions. [2018-11-28 12:25:42,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:25:42,360 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 154 transitions. [2018-11-28 12:25:42,360 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 109 [2018-11-28 12:25:42,361 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 116 states and 154 transitions. [2018-11-28 12:25:42,361 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2018-11-28 12:25:42,361 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2018-11-28 12:25:42,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 154 transitions. [2018-11-28 12:25:42,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:25:42,362 INFO L705 BuchiCegarLoop]: Abstraction has 116 states and 154 transitions. [2018-11-28 12:25:42,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 154 transitions. [2018-11-28 12:25:42,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 99. [2018-11-28 12:25:42,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-28 12:25:42,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 130 transitions. [2018-11-28 12:25:42,365 INFO L728 BuchiCegarLoop]: Abstraction has 99 states and 130 transitions. [2018-11-28 12:25:42,365 INFO L608 BuchiCegarLoop]: Abstraction has 99 states and 130 transitions. [2018-11-28 12:25:42,365 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 12:25:42,365 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 130 transitions. [2018-11-28 12:25:42,367 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2018-11-28 12:25:42,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:25:42,367 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:25:42,368 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:25:42,368 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-11-28 12:25:42,368 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-11-28 12:25:42,368 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-11-28 12:25:42,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:42,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1803984585, now seen corresponding path program 2 times [2018-11-28 12:25:42,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:42,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:42,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:42,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:42,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:42,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:42,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:42,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:42,383 INFO L82 PathProgramCache]: Analyzing trace with hash 331104409, now seen corresponding path program 1 times [2018-11-28 12:25:42,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:42,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:42,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:42,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:25:42,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:42,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:42,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:42,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:25:42,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:25:42,418 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:25:42,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:25:42,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:25:42,418 INFO L87 Difference]: Start difference. First operand 99 states and 130 transitions. cyclomatic complexity: 32 Second operand 3 states. [2018-11-28 12:25:42,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:42,433 INFO L93 Difference]: Finished difference Result 125 states and 159 transitions. [2018-11-28 12:25:42,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:25:42,434 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 159 transitions. [2018-11-28 12:25:42,435 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 108 [2018-11-28 12:25:42,435 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 125 states and 159 transitions. [2018-11-28 12:25:42,436 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2018-11-28 12:25:42,436 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2018-11-28 12:25:42,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 159 transitions. [2018-11-28 12:25:42,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:25:42,437 INFO L705 BuchiCegarLoop]: Abstraction has 125 states and 159 transitions. [2018-11-28 12:25:42,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 159 transitions. [2018-11-28 12:25:42,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-11-28 12:25:42,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-28 12:25:42,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 159 transitions. [2018-11-28 12:25:42,441 INFO L728 BuchiCegarLoop]: Abstraction has 125 states and 159 transitions. [2018-11-28 12:25:42,441 INFO L608 BuchiCegarLoop]: Abstraction has 125 states and 159 transitions. [2018-11-28 12:25:42,442 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 12:25:42,442 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 159 transitions. [2018-11-28 12:25:42,442 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 108 [2018-11-28 12:25:42,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:25:42,443 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:25:42,443 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:25:42,443 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:25:42,443 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-11-28 12:25:42,443 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-11-28 12:25:42,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:42,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1783039958, now seen corresponding path program 1 times [2018-11-28 12:25:42,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:42,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:42,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:42,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:42,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:42,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:42,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:42,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:42,454 INFO L82 PathProgramCache]: Analyzing trace with hash -62972986, now seen corresponding path program 1 times [2018-11-28 12:25:42,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:42,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:42,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:42,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:42,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:42,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:42,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:42,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:25:42,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:25:42,509 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:25:42,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:25:42,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:25:42,510 INFO L87 Difference]: Start difference. First operand 125 states and 159 transitions. cyclomatic complexity: 36 Second operand 5 states. [2018-11-28 12:25:42,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:42,606 INFO L93 Difference]: Finished difference Result 275 states and 346 transitions. [2018-11-28 12:25:42,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:25:42,606 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 275 states and 346 transitions. [2018-11-28 12:25:42,608 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 255 [2018-11-28 12:25:42,609 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 275 states to 275 states and 346 transitions. [2018-11-28 12:25:42,609 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 275 [2018-11-28 12:25:42,609 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 275 [2018-11-28 12:25:42,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 275 states and 346 transitions. [2018-11-28 12:25:42,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:25:42,611 INFO L705 BuchiCegarLoop]: Abstraction has 275 states and 346 transitions. [2018-11-28 12:25:42,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states and 346 transitions. [2018-11-28 12:25:42,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 134. [2018-11-28 12:25:42,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-28 12:25:42,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 167 transitions. [2018-11-28 12:25:42,615 INFO L728 BuchiCegarLoop]: Abstraction has 134 states and 167 transitions. [2018-11-28 12:25:42,615 INFO L608 BuchiCegarLoop]: Abstraction has 134 states and 167 transitions. [2018-11-28 12:25:42,615 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 12:25:42,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 134 states and 167 transitions. [2018-11-28 12:25:42,620 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 117 [2018-11-28 12:25:42,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:25:42,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:25:42,621 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:25:42,621 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:25:42,621 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-11-28 12:25:42,621 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-11-28 12:25:42,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:42,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1783039958, now seen corresponding path program 2 times [2018-11-28 12:25:42,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:42,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:42,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:42,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:42,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:42,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:42,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:42,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:42,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1078264795, now seen corresponding path program 1 times [2018-11-28 12:25:42,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:42,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:42,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:42,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:25:42,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:42,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:42,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:42,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:42,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1917816028, now seen corresponding path program 1 times [2018-11-28 12:25:42,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:42,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:42,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:42,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:42,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:42,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:42,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:42,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:25:42,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:25:42,776 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:25:42,777 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:25:42,777 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:25:42,777 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:25:42,777 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:25:42,777 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:25:42,778 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:25:42,778 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:25:42,778 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1_false-unreach-call_false-termination.cil.c_Iteration8_Loop [2018-11-28 12:25:42,778 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:25:42,778 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:25:42,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:42,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:42,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:42,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:42,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:42,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:42,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:42,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:42,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:42,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:42,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:42,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:42,956 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:25:42,957 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1c741429-5b35-4028-bd31-94d9ed4e351b/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:25:42,961 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:25:42,961 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:25:42,967 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:25:42,967 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_1c741429-5b35-4028-bd31-94d9ed4e351b/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:25:42,983 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:25:42,983 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:25:42,990 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:25:42,990 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_1c741429-5b35-4028-bd31-94d9ed4e351b/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:25:43,005 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:25:43,006 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1c741429-5b35-4028-bd31-94d9ed4e351b/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:25:43,024 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:25:43,024 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:25:43,056 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:25:43,058 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:25:43,058 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:25:43,058 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:25:43,059 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:25:43,059 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:25:43,059 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:25:43,059 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:25:43,059 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:25:43,059 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1_false-unreach-call_false-termination.cil.c_Iteration8_Loop [2018-11-28 12:25:43,059 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:25:43,059 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:25:43,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:43,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:43,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:43,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:43,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:43,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:43,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:43,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:43,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:43,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:43,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:43,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:43,291 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:25:43,295 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:25:43,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:43,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:43,300 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:25:43,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,302 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,303 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:43,303 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,306 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:25:43,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:43,307 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:43,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,310 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,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-11-28 12:25:43,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:43,311 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:43,315 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:25:43,316 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:43,318 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,318 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:25:43,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:43,319 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:43,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,320 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:43,324 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:43,325 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:25:43,325 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,326 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:43,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:43,327 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:25:43,328 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:43,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:43,334 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:25:43,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:43,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:43,338 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:25:43,338 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,340 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:43,340 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:43,341 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:25:43,341 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:43,343 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:43,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:25:43,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:43,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:43,346 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:25:43,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:43,348 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:43,349 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:25:43,349 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,350 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,351 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-28 12:25:43,351 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,351 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:43,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,352 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 12:25:43,352 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 12:25:43,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,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-11-28 12:25:43,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:43,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,354 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:25:43,355 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 12:25:43,355 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:25:43,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,360 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,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-11-28 12:25:43,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:43,363 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,363 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 12:25:43,364 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 12:25:43,364 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,366 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,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-11-28 12:25:43,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:43,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,372 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:25:43,372 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 12:25:43,374 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:25:43,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:43,375 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,376 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 12:25:43,376 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 12:25:43,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:43,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,382 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 12:25:43,383 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 12:25:43,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,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-11-28 12:25:43,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:43,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,385 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 12:25:43,385 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 12:25:43,386 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:43,397 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,400 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 12:25:43,400 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 12:25:43,401 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:43,404 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,405 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 12:25:43,405 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 12:25:43,405 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,406 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,406 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:43,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,407 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 12:25:43,407 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 12:25:43,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,411 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:43,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,412 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 12:25:43,412 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 12:25:43,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:43,414 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,415 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 12:25:43,416 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 12:25:43,416 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,417 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-28 12:25:43,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:43,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,418 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:43,419 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:43,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:43,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,421 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:25:43,421 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:43,421 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:25:43,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,425 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:43,426 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,426 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:43,427 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:43,427 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,430 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:43,430 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,431 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:25:43,431 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:43,431 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:25:43,431 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,432 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,432 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:43,433 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,433 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:43,434 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:43,434 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,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-11-28 12:25:43,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:43,436 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,437 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,437 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:43,437 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:43,438 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,438 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,439 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:43,439 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,440 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:43,440 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:43,441 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,445 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:43,445 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,446 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:43,446 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:43,446 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,448 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,449 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:43,449 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,450 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:43,450 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:43,450 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,451 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,452 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:43,452 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,453 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:43,453 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:43,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,456 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:43,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,457 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:43,457 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:43,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,459 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,459 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:43,460 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,460 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:43,461 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:43,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,462 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-28 12:25:43,463 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:43,463 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,464 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 12:25:43,464 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 12:25:43,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,466 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:43,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,467 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:25:43,467 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 12:25:43,468 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-28 12:25:43,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:43,473 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,474 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 12:25:43,474 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 12:25:43,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,476 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:43,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,478 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:25:43,478 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 12:25:43,478 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-28 12:25:43,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:43,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,481 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 12:25:43,481 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 12:25:43,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:43,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,484 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 12:25:43,484 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 12:25:43,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,485 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:43,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,486 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 12:25:43,487 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 12:25:43,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,492 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,492 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:43,493 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,493 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 12:25:43,494 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 12:25:43,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,496 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:43,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,497 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 12:25:43,498 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 12:25:43,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,499 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:43,500 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,500 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 12:25:43,501 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 12:25:43,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,504 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:43,504 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,505 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 12:25:43,505 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 12:25:43,505 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:43,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,508 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 12:25:43,508 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 12:25:43,509 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,510 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-28 12:25:43,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,511 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,511 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 12:25:43,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,511 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 12:25:43,512 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 12:25:43,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,514 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,514 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 12:25:43,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,514 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:25:43,514 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 12:25:43,515 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:25:43,516 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,523 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,523 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 12:25:43,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,524 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 12:25:43,525 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 12:25:43,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,528 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,528 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,528 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 12:25:43,528 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,529 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:25:43,529 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 12:25:43,530 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:25:43,530 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,531 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,531 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 12:25:43,531 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,532 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 12:25:43,532 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 12:25:43,532 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,533 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,534 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,534 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,534 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 12:25:43,534 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,535 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 12:25:43,535 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 12:25:43,535 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,537 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,537 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 12:25:43,537 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,538 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 12:25:43,538 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 12:25:43,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,544 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,544 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,545 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 12:25:43,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,545 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 12:25:43,546 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 12:25:43,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,549 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,550 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,550 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 12:25:43,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,550 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 12:25:43,551 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 12:25:43,551 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,553 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,553 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 12:25:43,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,553 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 12:25:43,554 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 12:25:43,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,559 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,560 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,560 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 12:25:43,560 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,560 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 12:25:43,561 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 12:25:43,561 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,562 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,563 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,563 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 12:25:43,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,564 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 12:25:43,564 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 12:25:43,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,566 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-28 12:25:43,566 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,566 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,567 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 12:25:43,567 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,567 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:43,568 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:43,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,570 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,570 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 12:25:43,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,570 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:25:43,571 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:43,572 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:25:43,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,580 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,581 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,581 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 12:25:43,581 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,582 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:43,582 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:43,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,587 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,587 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 12:25:43,587 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,587 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:25:43,587 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:43,589 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:25:43,589 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,590 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,591 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,591 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 12:25:43,591 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,591 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:43,592 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:43,592 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,594 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,594 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,595 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 12:25:43,595 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,598 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:43,599 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:43,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,601 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,601 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,601 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 12:25:43,601 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,602 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:43,603 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:43,603 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,622 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,622 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,622 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 12:25:43,623 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,626 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:43,627 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:43,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,632 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,632 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 12:25:43,633 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,633 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:43,634 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:43,634 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,636 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,636 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 12:25:43,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,637 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:43,637 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:43,637 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,676 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,676 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 12:25:43,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,677 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:43,677 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:43,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,688 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,688 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 12:25:43,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,689 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:43,690 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:43,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,692 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-28 12:25:43,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,693 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,693 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 12:25:43,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,693 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 12:25:43,694 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 12:25:43,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,695 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,696 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,696 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 12:25:43,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,696 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:25:43,696 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 12:25:43,699 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-28 12:25:43,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,709 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,709 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 12:25:43,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,709 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 12:25:43,710 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 12:25:43,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,716 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,716 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 12:25:43,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,716 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:25:43,716 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 12:25:43,718 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-28 12:25:43,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,719 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,719 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 12:25:43,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,720 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 12:25:43,721 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 12:25:43,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,722 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,722 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 12:25:43,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,723 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 12:25:43,723 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 12:25:43,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,725 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,725 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 12:25:43,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,726 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 12:25:43,727 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 12:25:43,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,741 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,741 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,742 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 12:25:43,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,742 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 12:25:43,743 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 12:25:43,743 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,748 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,748 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 12:25:43,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,749 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 12:25:43,750 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 12:25:43,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,751 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,751 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 12:25:43,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,752 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 12:25:43,753 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 12:25:43,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,770 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,770 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 12:25:43,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,770 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 12:25:43,771 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 12:25:43,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,773 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,773 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,773 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 12:25:43,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,774 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 12:25:43,775 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 12:25:43,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,777 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-28 12:25:43,777 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,777 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,777 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 12:25:43,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,778 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:43,778 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:43,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,780 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,780 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 12:25:43,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,781 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:25:43,781 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:43,781 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:25:43,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,787 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,787 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 12:25:43,787 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,787 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:43,787 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:43,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,790 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,790 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 12:25:43,790 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,790 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:25:43,790 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:43,791 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:25:43,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,796 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,796 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 12:25:43,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,797 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:43,797 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:43,797 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,798 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,799 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,799 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,799 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 12:25:43,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,800 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:43,803 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:43,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,805 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,805 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 12:25:43,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,806 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:43,806 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:43,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,812 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,812 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,813 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 12:25:43,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,813 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:43,813 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:43,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,817 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,817 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 12:25:43,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,817 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:43,818 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:43,818 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,820 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,820 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 12:25:43,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,820 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:43,821 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:43,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,824 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,825 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,825 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 12:25:43,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,825 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:43,826 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:43,826 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,829 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,830 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 12:25:43,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,830 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:43,830 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:43,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,833 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-28 12:25:43,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,834 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,834 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 12:25:43,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,834 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 12:25:43,835 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:25:43,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,837 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,838 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,838 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 12:25:43,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,838 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:25:43,838 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 12:25:43,839 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-28 12:25:43,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,849 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,850 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,850 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 12:25:43,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,850 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 12:25:43,851 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:25:43,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,854 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,854 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 12:25:43,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,855 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:25:43,855 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 12:25:43,855 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-28 12:25:43,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,857 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,858 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,858 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 12:25:43,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,858 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 12:25:43,859 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:25:43,859 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,862 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,862 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 12:25:43,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,862 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 12:25:43,863 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:25:43,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,866 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,866 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,866 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 12:25:43,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,867 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 12:25:43,868 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:25:43,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,880 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,880 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,880 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 12:25:43,881 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,881 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 12:25:43,881 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:25:43,882 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,886 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,886 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 12:25:43,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,887 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 12:25:43,887 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:25:43,887 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,891 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,891 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 12:25:43,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,891 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 12:25:43,892 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:25:43,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,896 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,896 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,897 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 12:25:43,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,897 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 12:25:43,898 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:25:43,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:43,902 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:43,902 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 12:25:43,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:43,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:43,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:43,903 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 12:25:43,904 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:25:43,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:43,908 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:43,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:25:43,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:25:43,909 INFO L87 Difference]: Start difference. First operand 134 states and 167 transitions. cyclomatic complexity: 35 Second operand 3 states. [2018-11-28 12:25:43,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:43,992 INFO L93 Difference]: Finished difference Result 220 states and 270 transitions. [2018-11-28 12:25:43,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:25:43,993 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 220 states and 270 transitions. [2018-11-28 12:25:43,994 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 201 [2018-11-28 12:25:43,995 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 220 states to 220 states and 270 transitions. [2018-11-28 12:25:43,995 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 220 [2018-11-28 12:25:43,996 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 220 [2018-11-28 12:25:43,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 220 states and 270 transitions. [2018-11-28 12:25:43,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:25:43,996 INFO L705 BuchiCegarLoop]: Abstraction has 220 states and 270 transitions. [2018-11-28 12:25:43,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states and 270 transitions. [2018-11-28 12:25:43,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2018-11-28 12:25:44,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-11-28 12:25:44,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 270 transitions. [2018-11-28 12:25:44,005 INFO L728 BuchiCegarLoop]: Abstraction has 220 states and 270 transitions. [2018-11-28 12:25:44,005 INFO L608 BuchiCegarLoop]: Abstraction has 220 states and 270 transitions. [2018-11-28 12:25:44,005 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-28 12:25:44,005 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 220 states and 270 transitions. [2018-11-28 12:25:44,006 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 201 [2018-11-28 12:25:44,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:25:44,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:25:44,006 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:25:44,006 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:25:44,007 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-11-28 12:25:44,007 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-11-28 12:25:44,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:44,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1783039958, now seen corresponding path program 3 times [2018-11-28 12:25:44,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:44,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:44,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:44,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:44,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:44,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:44,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:44,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:44,015 INFO L82 PathProgramCache]: Analyzing trace with hash -872319612, now seen corresponding path program 1 times [2018-11-28 12:25:44,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:44,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:44,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:44,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:25:44,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:44,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:44,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:44,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:25:44,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:25:44,068 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:25:44,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:25:44,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:25:44,069 INFO L87 Difference]: Start difference. First operand 220 states and 270 transitions. cyclomatic complexity: 54 Second operand 5 states. [2018-11-28 12:25:44,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:44,155 INFO L93 Difference]: Finished difference Result 428 states and 517 transitions. [2018-11-28 12:25:44,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:25:44,156 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 428 states and 517 transitions. [2018-11-28 12:25:44,158 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 387 [2018-11-28 12:25:44,161 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 428 states to 428 states and 517 transitions. [2018-11-28 12:25:44,161 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 428 [2018-11-28 12:25:44,162 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 428 [2018-11-28 12:25:44,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 428 states and 517 transitions. [2018-11-28 12:25:44,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:25:44,163 INFO L705 BuchiCegarLoop]: Abstraction has 428 states and 517 transitions. [2018-11-28 12:25:44,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states and 517 transitions. [2018-11-28 12:25:44,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 229. [2018-11-28 12:25:44,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-11-28 12:25:44,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 275 transitions. [2018-11-28 12:25:44,170 INFO L728 BuchiCegarLoop]: Abstraction has 229 states and 275 transitions. [2018-11-28 12:25:44,170 INFO L608 BuchiCegarLoop]: Abstraction has 229 states and 275 transitions. [2018-11-28 12:25:44,170 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-28 12:25:44,171 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 229 states and 275 transitions. [2018-11-28 12:25:44,172 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 210 [2018-11-28 12:25:44,172 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:25:44,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:25:44,175 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:25:44,175 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:25:44,176 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-11-28 12:25:44,176 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-11-28 12:25:44,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:44,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1783039958, now seen corresponding path program 4 times [2018-11-28 12:25:44,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:44,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:44,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:44,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:44,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:44,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:44,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:44,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:44,187 INFO L82 PathProgramCache]: Analyzing trace with hash -872319550, now seen corresponding path program 1 times [2018-11-28 12:25:44,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:44,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:44,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:44,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:25:44,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:44,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:44,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:44,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:44,200 INFO L82 PathProgramCache]: Analyzing trace with hash 2123761273, now seen corresponding path program 1 times [2018-11-28 12:25:44,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:44,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:44,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:44,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:44,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:44,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:44,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:44,284 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:25:44,284 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:25:44,284 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:25:44,284 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:25:44,284 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:25:44,284 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:25:44,284 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:25:44,284 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:25:44,284 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1_false-unreach-call_false-termination.cil.c_Iteration10_Loop [2018-11-28 12:25:44,284 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:25:44,284 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:25:44,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:44,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:44,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:44,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:44,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:44,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:44,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:44,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:44,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:44,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:44,423 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:25:44,423 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1c741429-5b35-4028-bd31-94d9ed4e351b/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:25:44,433 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:25:44,433 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:25:44,436 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:25:44,436 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_1c741429-5b35-4028-bd31-94d9ed4e351b/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:25:44,468 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:25:44,469 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:25:44,473 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:25:44,473 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_1c741429-5b35-4028-bd31-94d9ed4e351b/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:25:44,501 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:25:44,501 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1c741429-5b35-4028-bd31-94d9ed4e351b/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:25:44,537 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:25:44,538 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:25:44,570 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:25:44,573 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:25:44,573 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:25:44,573 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:25:44,573 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:25:44,573 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:25:44,573 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:25:44,573 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:25:44,573 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:25:44,573 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1_false-unreach-call_false-termination.cil.c_Iteration10_Loop [2018-11-28 12:25:44,573 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:25:44,574 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:25:44,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:44,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:44,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:44,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:44,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:44,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:44,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:44,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:44,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:44,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:44,717 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:25:44,717 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:25:44,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:44,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:44,719 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:25:44,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:44,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:44,721 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:25:44,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:44,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,722 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:25:44,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:44,723 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:44,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:44,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:44,726 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:25:44,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:44,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:44,728 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:25:44,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,729 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:44,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:44,730 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:25:44,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:44,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:44,732 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:25:44,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:44,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,734 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:25:44,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:44,734 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:44,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:44,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:44,736 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:25:44,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:44,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,738 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:25:44,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:44,738 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:44,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,739 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-28 12:25:44,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:44,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,740 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 12:25:44,740 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 12:25:44,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,741 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:44,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,742 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 12:25:44,742 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 12:25:44,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:44,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,744 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:25:44,744 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 12:25:44,744 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:25:44,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:44,747 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,747 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 12:25:44,748 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 12:25:44,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:44,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,750 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 12:25:44,750 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 12:25:44,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:44,752 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,752 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 12:25:44,752 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 12:25:44,752 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:44,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,754 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 12:25:44,754 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 12:25:44,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:44,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,756 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:25:44,756 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 12:25:44,756 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:25:44,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,757 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:44,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,758 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 12:25:44,758 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 12:25:44,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:44,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,760 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:25:44,760 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 12:25:44,760 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:25:44,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,761 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-28 12:25:44,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:44,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,762 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:44,762 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:44,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:44,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,763 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:44,764 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:44,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:44,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,765 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:25:44,765 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:44,765 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:25:44,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:44,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,768 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:44,769 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:44,769 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:44,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,770 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:44,771 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:44,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:44,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,772 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:44,773 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:44,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:44,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,774 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:44,775 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:44,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:44,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,777 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:25:44,777 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:44,777 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:25:44,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:44,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,778 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:44,779 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:44,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:44,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,781 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:25:44,781 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:44,781 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:25:44,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,782 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-28 12:25:44,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:44,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,783 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 12:25:44,783 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 12:25:44,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:44,784 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,784 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 12:25:44,784 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 12:25:44,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:44,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,786 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:25:44,786 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 12:25:44,786 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-28 12:25:44,786 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:44,789 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,790 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 12:25:44,790 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 12:25:44,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,791 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,791 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:44,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,792 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 12:25:44,792 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 12:25:44,792 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:44,794 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,794 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 12:25:44,794 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 12:25:44,794 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:44,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,796 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 12:25:44,796 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 12:25:44,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,798 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,798 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:44,798 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,798 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:25:44,798 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 12:25:44,799 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-28 12:25:44,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:44,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,800 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 12:25:44,800 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 12:25:44,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:44,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,803 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:25:44,803 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 12:25:44,803 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-28 12:25:44,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,803 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,804 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-28 12:25:44,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,804 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:44,804 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 12:25:44,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,805 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 12:25:44,805 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 12:25:44,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,806 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:44,806 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 12:25:44,806 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,807 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 12:25:44,807 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 12:25:44,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,807 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,808 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,808 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:44,808 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 12:25:44,808 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,808 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:25:44,808 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 12:25:44,809 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:25:44,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,812 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,813 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:44,813 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 12:25:44,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,813 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 12:25:44,814 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 12:25:44,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,815 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:44,815 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 12:25:44,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,815 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 12:25:44,816 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 12:25:44,816 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,817 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:44,817 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 12:25:44,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,818 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 12:25:44,818 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 12:25:44,818 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,820 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:44,820 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 12:25:44,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,820 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 12:25:44,820 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 12:25:44,820 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,822 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,823 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:44,823 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 12:25:44,823 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,823 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:25:44,823 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 12:25:44,823 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:25:44,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,826 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:44,826 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 12:25:44,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,826 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 12:25:44,827 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 12:25:44,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,830 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:44,830 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 12:25:44,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,830 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:25:44,830 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 12:25:44,831 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:25:44,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,833 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-28 12:25:44,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,833 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:44,833 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 12:25:44,833 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,834 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:44,834 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:44,834 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,835 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,836 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:44,836 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 12:25:44,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,836 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:44,837 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:44,837 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,838 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:44,838 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 12:25:44,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,838 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:25:44,839 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:44,839 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:25:44,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,844 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,845 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:44,845 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 12:25:44,845 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,845 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:44,846 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:44,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,848 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:44,848 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 12:25:44,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,849 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:44,849 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:44,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,851 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,851 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:44,852 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 12:25:44,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,852 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:44,853 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:44,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,855 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:44,855 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 12:25:44,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,855 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:44,856 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:44,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,859 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:44,859 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 12:25:44,859 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,859 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:25:44,860 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:44,860 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:25:44,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,863 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,863 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:44,863 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 12:25:44,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,864 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:44,864 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:44,864 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,869 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,869 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:44,869 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 12:25:44,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,870 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:25:44,870 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:44,871 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:25:44,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,873 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-28 12:25:44,873 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,874 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:44,874 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 12:25:44,874 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,874 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 12:25:44,875 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 12:25:44,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,875 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,876 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,876 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:44,876 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 12:25:44,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,876 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 12:25:44,877 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 12:25:44,877 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,878 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,878 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:44,878 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 12:25:44,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,879 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:25:44,879 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 12:25:44,880 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-28 12:25:44,880 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,888 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:44,888 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 12:25:44,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,888 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 12:25:44,890 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 12:25:44,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,891 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:44,891 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 12:25:44,892 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,892 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 12:25:44,893 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 12:25:44,893 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,894 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,895 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:44,895 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 12:25:44,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,895 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 12:25:44,896 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 12:25:44,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,898 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,898 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:44,898 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 12:25:44,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,899 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 12:25:44,899 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 12:25:44,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,903 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,904 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:44,904 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 12:25:44,904 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,904 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:25:44,904 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 12:25:44,905 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-28 12:25:44,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,910 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,911 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:44,911 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 12:25:44,911 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,911 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 12:25:44,912 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 12:25:44,912 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,921 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,922 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:44,922 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 12:25:44,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,922 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:25:44,922 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 12:25:44,923 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-28 12:25:44,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,928 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,928 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-28 12:25:44,928 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,928 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:44,929 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 12:25:44,929 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,929 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:44,929 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:44,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,931 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:44,931 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 12:25:44,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,931 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:44,932 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:44,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,933 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:44,933 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 12:25:44,933 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,934 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:25:44,934 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:44,934 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:25:44,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,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-11-28 12:25:44,946 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:44,946 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 12:25:44,947 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,947 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:44,947 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:44,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,950 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,950 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:44,950 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 12:25:44,950 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,951 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:44,951 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:44,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,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-11-28 12:25:44,954 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:44,954 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 12:25:44,954 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,954 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:44,955 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:44,955 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,957 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,957 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,969 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:44,969 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 12:25:44,969 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,970 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:44,970 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:44,970 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,972 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,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-11-28 12:25:44,972 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:44,973 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 12:25:44,973 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,973 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:25:44,973 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:44,973 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:25:44,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,975 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,975 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:44,976 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 12:25:44,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,976 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:44,976 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 12:25:44,976 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,978 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,979 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,994 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:44,994 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 12:25:44,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,995 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:25:44,995 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 12:25:44,995 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:25:44,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:44,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:44,997 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-28 12:25:44,997 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:44,997 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:44,997 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 12:25:44,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:44,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:44,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:44,998 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 12:25:44,998 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:25:44,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:45,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:45,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:45,001 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:45,001 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 12:25:45,001 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:45,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:45,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:45,001 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 12:25:45,002 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:25:45,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:45,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:45,004 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:45,018 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:45,018 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 12:25:45,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:45,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:45,019 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:25:45,019 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 12:25:45,020 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-28 12:25:45,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:45,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:45,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:45,028 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:45,028 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 12:25:45,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:45,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:45,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:45,029 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 12:25:45,029 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:25:45,029 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:45,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:45,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:45,036 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:45,036 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 12:25:45,036 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:45,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:45,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:45,036 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 12:25:45,037 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:25:45,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:45,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:45,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:45,042 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:45,042 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 12:25:45,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:45,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:45,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:45,042 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 12:25:45,043 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:25:45,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:45,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:45,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:45,050 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:45,050 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 12:25:45,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:45,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:45,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:45,051 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 12:25:45,051 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:25:45,051 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:45,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:45,056 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:45,056 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:45,056 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 12:25:45,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:45,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:45,057 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:25:45,057 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 12:25:45,057 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-28 12:25:45,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:45,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:45,067 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:45,067 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:45,067 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 12:25:45,067 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:45,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:45,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:45,068 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 12:25:45,069 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:25:45,069 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:45,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:45,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-11-28 12:25:45,074 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 12:25:45,074 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 12:25:45,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:45,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:45,074 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:25:45,074 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 12:25:45,075 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-28 12:25:45,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:45,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:45,474 WARN L180 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2018-11-28 12:25:45,504 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:25:45,504 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:25:45,504 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:25:45,504 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:25:45,504 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:25:45,504 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:25:45,504 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:25:45,504 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:25:45,505 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1_false-unreach-call_false-termination.cil.c_Iteration10_Lasso [2018-11-28 12:25:45,505 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:25:45,505 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:25:45,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:45,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:45,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:45,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-11-28 12:25:45,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:45,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:45,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:45,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:45,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:45,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:45,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:45,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:45,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:45,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:45,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:45,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:45,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:45,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:45,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:45,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:45,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:45,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:45,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:45,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:45,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:45,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:45,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:45,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:45,842 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:25:45,842 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1c741429-5b35-4028-bd31-94d9ed4e351b/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:25:45,853 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:25:45,853 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:25:45,856 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:25:45,856 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_1c741429-5b35-4028-bd31-94d9ed4e351b/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:25:45,877 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:25:45,877 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:25:45,879 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:25:45,879 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_1c741429-5b35-4028-bd31-94d9ed4e351b/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:25:45,901 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:25:45,901 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:25:45,904 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:25:45,904 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_1c741429-5b35-4028-bd31-94d9ed4e351b/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:25:45,930 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:25:45,930 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1c741429-5b35-4028-bd31-94d9ed4e351b/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:25:45,947 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:25:45,947 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:25:45,963 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:25:45,965 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:25:45,965 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:25:45,965 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:25:45,965 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:25:45,965 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:25:45,965 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:25:45,965 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:25:45,965 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:25:45,965 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1_false-unreach-call_false-termination.cil.c_Iteration10_Lasso [2018-11-28 12:25:45,965 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:25:45,965 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:25:45,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:45,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:45,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:45,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:45,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:45,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:45,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:45,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:45,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:45,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:46,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:46,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:46,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:46,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:46,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:46,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:46,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:46,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:46,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:46,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:46,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:46,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:46,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:46,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:46,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:46,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:46,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:46,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:25:46,193 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:25:46,194 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:25:46,194 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:46,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:46,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:46,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:46,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:46,196 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:25:46,197 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:25:46,199 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:46,199 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:46,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:46,200 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:46,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:46,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:46,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:46,200 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:25:46,200 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:46,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:46,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:46,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:46,201 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:25:46,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:46,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:46,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:46,202 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:25:46,202 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:25:46,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:46,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:46,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:46,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:46,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:25:46,203 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:46,203 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:25:46,203 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:25:46,206 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:25:46,206 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:25:46,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:25:46,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:25:46,206 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 12:25:46,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:25:46,208 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-28 12:25:46,208 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-28 12:25:46,215 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:25:46,221 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 12:25:46,221 INFO L444 ModelExtractionUtils]: 6 out of 11 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 12:25:46,223 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:25:46,224 INFO L440 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2018-11-28 12:25:46,224 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:25:46,225 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-11-28 12:25:46,252 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2018-11-28 12:25:46,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:46,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:46,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:46,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:46,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:25:46,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:46,369 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-11-28 12:25:46,370 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 229 states and 275 transitions. cyclomatic complexity: 50 Second operand 6 states. [2018-11-28 12:25:46,481 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-11-28 12:25:46,481 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-11-28 12:25:46,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 12:25:46,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 340 transitions. [2018-11-28 12:25:46,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 340 transitions. Stem has 16 letters. Loop has 15 letters. [2018-11-28 12:25:46,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:25:46,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 340 transitions. Stem has 31 letters. Loop has 15 letters. [2018-11-28 12:25:46,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:25:46,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 340 transitions. Stem has 16 letters. Loop has 30 letters. [2018-11-28 12:25:46,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:25:46,486 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1087 states and 1324 transitions. [2018-11-28 12:25:46,494 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 563 [2018-11-28 12:25:46,498 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1087 states to 892 states and 1084 transitions. [2018-11-28 12:25:46,498 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 646 [2018-11-28 12:25:46,498 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 650 [2018-11-28 12:25:46,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 892 states and 1084 transitions. [2018-11-28 12:25:46,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:25:46,499 INFO L705 BuchiCegarLoop]: Abstraction has 892 states and 1084 transitions. [2018-11-28 12:25:46,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states and 1084 transitions. [2018-11-28 12:25:46,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 659. [2018-11-28 12:25:46,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2018-11-28 12:25:46,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 802 transitions. [2018-11-28 12:25:46,509 INFO L728 BuchiCegarLoop]: Abstraction has 659 states and 802 transitions. [2018-11-28 12:25:46,509 INFO L608 BuchiCegarLoop]: Abstraction has 659 states and 802 transitions. [2018-11-28 12:25:46,509 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-28 12:25:46,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 659 states and 802 transitions. [2018-11-28 12:25:46,512 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 377 [2018-11-28 12:25:46,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:25:46,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:25:46,513 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:25:46,513 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:25:46,513 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-11-28 12:25:46,513 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-11-28 12:25:46,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:46,513 INFO L82 PathProgramCache]: Analyzing trace with hash 560336285, now seen corresponding path program 1 times [2018-11-28 12:25:46,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:46,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:46,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:46,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:46,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:46,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:46,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:46,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:25:46,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:25:46,537 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:25:46,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:46,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1691430829, now seen corresponding path program 1 times [2018-11-28 12:25:46,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:46,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:46,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:46,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:46,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:46,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:46,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:46,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:25:46,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-11-28 12:25:46,551 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:25:46,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:25:46,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:25:46,551 INFO L87 Difference]: Start difference. First operand 659 states and 802 transitions. cyclomatic complexity: 155 Second operand 3 states. [2018-11-28 12:25:46,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:46,585 INFO L93 Difference]: Finished difference Result 372 states and 445 transitions. [2018-11-28 12:25:46,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:25:46,585 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 372 states and 445 transitions. [2018-11-28 12:25:46,587 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 233 [2018-11-28 12:25:46,589 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 372 states to 314 states and 376 transitions. [2018-11-28 12:25:46,589 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 311 [2018-11-28 12:25:46,589 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 314 [2018-11-28 12:25:46,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 314 states and 376 transitions. [2018-11-28 12:25:46,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:25:46,590 INFO L705 BuchiCegarLoop]: Abstraction has 314 states and 376 transitions. [2018-11-28 12:25:46,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states and 376 transitions. [2018-11-28 12:25:46,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 249. [2018-11-28 12:25:46,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-11-28 12:25:46,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 301 transitions. [2018-11-28 12:25:46,594 INFO L728 BuchiCegarLoop]: Abstraction has 249 states and 301 transitions. [2018-11-28 12:25:46,594 INFO L608 BuchiCegarLoop]: Abstraction has 249 states and 301 transitions. [2018-11-28 12:25:46,594 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-28 12:25:46,594 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 249 states and 301 transitions. [2018-11-28 12:25:46,595 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 206 [2018-11-28 12:25:46,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:25:46,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:25:46,595 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-11-28 12:25:46,595 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:25:46,595 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-11-28 12:25:46,596 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-11-28 12:25:46,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:46,596 INFO L82 PathProgramCache]: Analyzing trace with hash 190554158, now seen corresponding path program 1 times [2018-11-28 12:25:46,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:46,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:46,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:46,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:46,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:46,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:46,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:46,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:25:46,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 12:25:46,622 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:25:46,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:46,623 INFO L82 PathProgramCache]: Analyzing trace with hash 313858188, now seen corresponding path program 1 times [2018-11-28 12:25:46,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:46,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:46,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:46,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:46,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:46,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:46,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:46,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:25:46,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 12:25:46,635 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:25:46,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:25:46,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:25:46,635 INFO L87 Difference]: Start difference. First operand 249 states and 301 transitions. cyclomatic complexity: 54 Second operand 3 states. [2018-11-28 12:25:46,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:46,669 INFO L93 Difference]: Finished difference Result 308 states and 364 transitions. [2018-11-28 12:25:46,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:25:46,670 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 308 states and 364 transitions. [2018-11-28 12:25:46,672 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 258 [2018-11-28 12:25:46,673 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 308 states to 308 states and 364 transitions. [2018-11-28 12:25:46,673 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 308 [2018-11-28 12:25:46,674 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 308 [2018-11-28 12:25:46,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 308 states and 364 transitions. [2018-11-28 12:25:46,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:25:46,674 INFO L705 BuchiCegarLoop]: Abstraction has 308 states and 364 transitions. [2018-11-28 12:25:46,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states and 364 transitions. [2018-11-28 12:25:46,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 218. [2018-11-28 12:25:46,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-11-28 12:25:46,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 258 transitions. [2018-11-28 12:25:46,678 INFO L728 BuchiCegarLoop]: Abstraction has 218 states and 258 transitions. [2018-11-28 12:25:46,678 INFO L608 BuchiCegarLoop]: Abstraction has 218 states and 258 transitions. [2018-11-28 12:25:46,678 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-28 12:25:46,678 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 218 states and 258 transitions. [2018-11-28 12:25:46,679 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 168 [2018-11-28 12:25:46,679 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:25:46,679 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:25:46,679 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-11-28 12:25:46,679 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:25:46,680 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-11-28 12:25:46,680 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-11-28 12:25:46,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:46,680 INFO L82 PathProgramCache]: Analyzing trace with hash 190554158, now seen corresponding path program 2 times [2018-11-28 12:25:46,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:46,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:46,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:46,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:46,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:46,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:46,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:46,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:25:46,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 12:25:46,710 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:25:46,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:46,710 INFO L82 PathProgramCache]: Analyzing trace with hash -750519281, now seen corresponding path program 1 times [2018-11-28 12:25:46,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:46,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:46,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:46,711 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:25:46,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:46,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:46,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:46,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:25:46,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:25:46,745 INFO L87 Difference]: Start difference. First operand 218 states and 258 transitions. cyclomatic complexity: 43 Second operand 3 states. [2018-11-28 12:25:46,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:46,755 INFO L93 Difference]: Finished difference Result 241 states and 282 transitions. [2018-11-28 12:25:46,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:25:46,756 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 241 states and 282 transitions. [2018-11-28 12:25:46,757 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 190 [2018-11-28 12:25:46,758 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 241 states to 240 states and 281 transitions. [2018-11-28 12:25:46,758 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 240 [2018-11-28 12:25:46,758 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 240 [2018-11-28 12:25:46,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 240 states and 281 transitions. [2018-11-28 12:25:46,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:25:46,759 INFO L705 BuchiCegarLoop]: Abstraction has 240 states and 281 transitions. [2018-11-28 12:25:46,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states and 281 transitions. [2018-11-28 12:25:46,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 217. [2018-11-28 12:25:46,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-11-28 12:25:46,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 256 transitions. [2018-11-28 12:25:46,762 INFO L728 BuchiCegarLoop]: Abstraction has 217 states and 256 transitions. [2018-11-28 12:25:46,762 INFO L608 BuchiCegarLoop]: Abstraction has 217 states and 256 transitions. [2018-11-28 12:25:46,762 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-28 12:25:46,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 217 states and 256 transitions. [2018-11-28 12:25:46,763 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 168 [2018-11-28 12:25:46,763 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:25:46,763 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:25:46,764 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:25:46,764 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:25:46,764 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-11-28 12:25:46,764 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-11-28 12:25:46,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:46,764 INFO L82 PathProgramCache]: Analyzing trace with hash -2034026126, now seen corresponding path program 1 times [2018-11-28 12:25:46,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:46,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:46,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:46,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:46,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:46,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:25:46,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:25:46,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:25:46,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:25:46,801 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:25:46,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:46,802 INFO L82 PathProgramCache]: Analyzing trace with hash -750519281, now seen corresponding path program 2 times [2018-11-28 12:25:46,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:46,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:46,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:46,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:46,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:46,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:46,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:25:46,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:25:46,834 INFO L87 Difference]: Start difference. First operand 217 states and 256 transitions. cyclomatic complexity: 42 Second operand 3 states. [2018-11-28 12:25:46,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:25:46,863 INFO L93 Difference]: Finished difference Result 210 states and 244 transitions. [2018-11-28 12:25:46,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:25:46,864 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 210 states and 244 transitions. [2018-11-28 12:25:46,865 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 168 [2018-11-28 12:25:46,866 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 210 states to 210 states and 244 transitions. [2018-11-28 12:25:46,866 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 210 [2018-11-28 12:25:46,866 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 210 [2018-11-28 12:25:46,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 210 states and 244 transitions. [2018-11-28 12:25:46,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:25:46,867 INFO L705 BuchiCegarLoop]: Abstraction has 210 states and 244 transitions. [2018-11-28 12:25:46,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states and 244 transitions. [2018-11-28 12:25:46,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2018-11-28 12:25:46,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-11-28 12:25:46,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 244 transitions. [2018-11-28 12:25:46,870 INFO L728 BuchiCegarLoop]: Abstraction has 210 states and 244 transitions. [2018-11-28 12:25:46,871 INFO L608 BuchiCegarLoop]: Abstraction has 210 states and 244 transitions. [2018-11-28 12:25:46,871 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-28 12:25:46,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 210 states and 244 transitions. [2018-11-28 12:25:46,871 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 168 [2018-11-28 12:25:46,872 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:25:46,872 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:25:46,872 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-11-28 12:25:46,872 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:25:46,872 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-11-28 12:25:46,872 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-11-28 12:25:46,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:46,873 INFO L82 PathProgramCache]: Analyzing trace with hash 825120445, now seen corresponding path program 1 times [2018-11-28 12:25:46,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:46,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:46,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:46,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:25:46,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:46,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:46,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:46,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:46,884 INFO L82 PathProgramCache]: Analyzing trace with hash -750519281, now seen corresponding path program 3 times [2018-11-28 12:25:46,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:46,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:46,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:46,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:25:46,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:46,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:46,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:46,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:25:46,887 INFO L82 PathProgramCache]: Analyzing trace with hash 250746827, now seen corresponding path program 1 times [2018-11-28 12:25:46,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:25:46,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:25:46,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:46,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:25:46,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:25:46,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:46,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:25:47,092 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 103 [2018-11-28 12:25:47,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 12:25:47 BoogieIcfgContainer [2018-11-28 12:25:47,154 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 12:25:47,154 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 12:25:47,154 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 12:25:47,154 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 12:25:47,154 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:25:41" (3/4) ... [2018-11-28 12:25:47,157 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-28 12:25:47,197 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_1c741429-5b35-4028-bd31-94d9ed4e351b/bin-2019/uautomizer/witness.graphml [2018-11-28 12:25:47,197 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 12:25:47,198 INFO L168 Benchmark]: Toolchain (without parser) took 5986.59 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 311.4 MB). Free memory was 954.4 MB in the beginning and 943.3 MB in the end (delta: 11.0 MB). Peak memory consumption was 322.5 MB. Max. memory is 11.5 GB. [2018-11-28 12:25:47,198 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:25:47,198 INFO L168 Benchmark]: CACSL2BoogieTranslator took 197.29 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 939.9 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-28 12:25:47,199 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -190.3 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-28 12:25:47,199 INFO L168 Benchmark]: Boogie Preprocessor took 19.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-28 12:25:47,199 INFO L168 Benchmark]: RCFGBuilder took 297.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. [2018-11-28 12:25:47,199 INFO L168 Benchmark]: BuchiAutomizer took 5362.98 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 179.3 MB). Free memory was 1.1 GB in the beginning and 943.3 MB in the end (delta: 158.0 MB). Peak memory consumption was 337.3 MB. Max. memory is 11.5 GB. [2018-11-28 12:25:47,200 INFO L168 Benchmark]: Witness Printer took 42.98 ms. Allocated memory is still 1.3 GB. Free memory is still 943.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:25:47,201 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 197.29 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 939.9 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -190.3 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 297.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5362.98 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 179.3 MB). Free memory was 1.1 GB in the beginning and 943.3 MB in the end (delta: 158.0 MB). Peak memory consumption was 337.3 MB. Max. memory is 11.5 GB. * Witness Printer took 42.98 ms. Allocated memory is still 1.3 GB. Free memory is still 943.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (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 5.3s and 15 iterations. TraceHistogramMax:2. Analysis of lassos took 4.3s. Construction of modules took 0.3s. Büchi inclusion checks took 0.3s. 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.3s 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: 18ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - 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@400046f=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@75fb6df5=0, p_dw_pc=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2496020d=0, tmp=0, q_free=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@20e5c90a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3a6fe5de=0, __retres1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7071e8af=0, p_dw_st=2, \result=0, tmp___0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@33f4d84e=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...