./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/systemc/pc_sfifo_1_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/systemc/pc_sfifo_1_false-unreach-call_false-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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.24-0ed9222-m [2019-01-14 04:37:16,174 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:37:16,177 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:37:16,194 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:37:16,196 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:37:16,198 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:37:16,203 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:37:16,207 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:37:16,219 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:37:16,221 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:37:16,223 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:37:16,224 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:37:16,225 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:37:16,227 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:37:16,228 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:37:16,229 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:37:16,230 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:37:16,236 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:37:16,244 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:37:16,247 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:37:16,249 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:37:16,250 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:37:16,255 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:37:16,255 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:37:16,256 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:37:16,258 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:37:16,259 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:37:16,262 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:37:16,263 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:37:16,265 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:37:16,268 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:37:16,269 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:37:16,269 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:37:16,269 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:37:16,273 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:37:16,274 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:37:16,276 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:37:16,303 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:37:16,304 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:37:16,305 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:37:16,305 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:37:16,305 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:37:16,306 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:37:16,306 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:37:16,306 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:37:16,306 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:37:16,306 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:37:16,307 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:37:16,307 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:37:16,307 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:37:16,307 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:37:16,307 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:37:16,308 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:37:16,308 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:37:16,308 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:37:16,308 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:37:16,308 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:37:16,309 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:37:16,309 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:37:16,309 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:37:16,309 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:37:16,309 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:37:16,310 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:37:16,310 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:37:16,310 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:37:16,310 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:37:16,310 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:37:16,310 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:37:16,312 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:37:16,312 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 [2019-01-14 04:37:16,372 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:37:16,387 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:37:16,391 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:37:16,394 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:37:16,394 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:37:16,395 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/systemc/pc_sfifo_1_false-unreach-call_false-termination.cil.c [2019-01-14 04:37:16,474 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40890e7ec/0973debdbeb745448efa2447a68f4b16/FLAGdf4132eb9 [2019-01-14 04:37:16,968 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:37:16,969 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/systemc/pc_sfifo_1_false-unreach-call_false-termination.cil.c [2019-01-14 04:37:16,979 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40890e7ec/0973debdbeb745448efa2447a68f4b16/FLAGdf4132eb9 [2019-01-14 04:37:17,302 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40890e7ec/0973debdbeb745448efa2447a68f4b16 [2019-01-14 04:37:17,308 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:37:17,312 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:37:17,313 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:37:17,313 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:37:17,319 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:37:17,320 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:37:17" (1/1) ... [2019-01-14 04:37:17,323 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3860a044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:37:17, skipping insertion in model container [2019-01-14 04:37:17,323 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:37:17" (1/1) ... [2019-01-14 04:37:17,334 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:37:17,383 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:37:17,711 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:37:17,718 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:37:17,786 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:37:17,820 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:37:17,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:37:17 WrapperNode [2019-01-14 04:37:17,820 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:37:17,821 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:37:17,822 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:37:17,822 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:37:17,833 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:37:17" (1/1) ... [2019-01-14 04:37:17,842 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:37:17" (1/1) ... [2019-01-14 04:37:17,893 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:37:17,894 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:37:17,895 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:37:17,895 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:37:17,908 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:37:17" (1/1) ... [2019-01-14 04:37:17,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:37:17" (1/1) ... [2019-01-14 04:37:17,913 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:37:17" (1/1) ... [2019-01-14 04:37:17,914 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:37:17" (1/1) ... [2019-01-14 04:37:18,012 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:37:17" (1/1) ... [2019-01-14 04:37:18,035 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:37:17" (1/1) ... [2019-01-14 04:37:18,039 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:37:17" (1/1) ... [2019-01-14 04:37:18,048 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:37:18,049 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:37:18,049 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:37:18,049 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:37:18,051 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:37:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 04:37:18,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:37:18,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:37:18,878 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:37:18,878 INFO L286 CfgBuilder]: Removed 44 assue(true) statements. [2019-01-14 04:37:18,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:37:18 BoogieIcfgContainer [2019-01-14 04:37:18,882 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:37:18,883 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:37:18,884 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:37:18,889 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:37:18,891 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:37:18,891 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:37:17" (1/3) ... [2019-01-14 04:37:18,895 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45625d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:37:18, skipping insertion in model container [2019-01-14 04:37:18,897 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:37:18,898 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:37:17" (2/3) ... [2019-01-14 04:37:18,899 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45625d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:37:18, skipping insertion in model container [2019-01-14 04:37:18,900 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:37:18,900 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:37:18" (3/3) ... [2019-01-14 04:37:18,902 INFO L375 chiAutomizerObserver]: Analyzing ICFG pc_sfifo_1_false-unreach-call_false-termination.cil.c [2019-01-14 04:37:18,983 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:37:18,984 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:37:18,985 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:37:18,985 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:37:18,985 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:37:18,985 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:37:18,985 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:37:18,986 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:37:18,986 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:37:19,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states. [2019-01-14 04:37:19,039 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2019-01-14 04:37:19,039 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:37:19,039 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:37:19,049 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 04:37:19,049 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:37:19,049 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:37:19,049 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states. [2019-01-14 04:37:19,056 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2019-01-14 04:37:19,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:37:19,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:37:19,057 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 04:37:19,057 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:37:19,067 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 [2019-01-14 04:37:19,068 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 [2019-01-14 04:37:19,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:19,073 INFO L82 PathProgramCache]: Analyzing trace with hash 28692871, now seen corresponding path program 1 times [2019-01-14 04:37:19,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:19,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:19,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:19,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:19,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:19,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:19,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:19,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:19,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:37:19,235 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:37:19,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:19,235 INFO L82 PathProgramCache]: Analyzing trace with hash -778318386, now seen corresponding path program 1 times [2019-01-14 04:37:19,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:19,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:19,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:19,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:19,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:19,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:19,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:19,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:19,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 04:37:19,248 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:37:19,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:37:19,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:37:19,272 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 3 states. [2019-01-14 04:37:19,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:37:19,312 INFO L93 Difference]: Finished difference Result 75 states and 103 transitions. [2019-01-14 04:37:19,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:37:19,316 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 103 transitions. [2019-01-14 04:37:19,320 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2019-01-14 04:37:19,328 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 68 states and 96 transitions. [2019-01-14 04:37:19,330 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2019-01-14 04:37:19,331 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-01-14 04:37:19,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 96 transitions. [2019-01-14 04:37:19,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:37:19,333 INFO L706 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2019-01-14 04:37:19,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 96 transitions. [2019-01-14 04:37:19,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-14 04:37:19,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-14 04:37:19,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2019-01-14 04:37:19,372 INFO L729 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2019-01-14 04:37:19,373 INFO L609 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2019-01-14 04:37:19,373 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:37:19,373 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 96 transitions. [2019-01-14 04:37:19,376 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2019-01-14 04:37:19,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:37:19,376 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:37:19,377 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 04:37:19,377 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:37:19,377 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 [2019-01-14 04:37:19,378 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 [2019-01-14 04:37:19,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:19,378 INFO L82 PathProgramCache]: Analyzing trace with hash 28692809, now seen corresponding path program 1 times [2019-01-14 04:37:19,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:19,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:19,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:19,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:19,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:19,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:19,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:19,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:19,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 04:37:19,458 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:37:19,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:19,459 INFO L82 PathProgramCache]: Analyzing trace with hash -852169887, now seen corresponding path program 1 times [2019-01-14 04:37:19,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:19,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:19,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:19,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:19,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:19,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:19,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:19,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:19,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:37:19,652 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:37:19,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:37:19,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:37:19,658 INFO L87 Difference]: Start difference. First operand 68 states and 96 transitions. cyclomatic complexity: 29 Second operand 3 states. [2019-01-14 04:37:19,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:37:19,699 INFO L93 Difference]: Finished difference Result 68 states and 95 transitions. [2019-01-14 04:37:19,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:37:19,701 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 95 transitions. [2019-01-14 04:37:19,709 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2019-01-14 04:37:19,715 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 68 states and 95 transitions. [2019-01-14 04:37:19,715 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2019-01-14 04:37:19,716 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-01-14 04:37:19,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 95 transitions. [2019-01-14 04:37:19,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:37:19,718 INFO L706 BuchiCegarLoop]: Abstraction has 68 states and 95 transitions. [2019-01-14 04:37:19,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 95 transitions. [2019-01-14 04:37:19,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-14 04:37:19,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-14 04:37:19,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 95 transitions. [2019-01-14 04:37:19,724 INFO L729 BuchiCegarLoop]: Abstraction has 68 states and 95 transitions. [2019-01-14 04:37:19,725 INFO L609 BuchiCegarLoop]: Abstraction has 68 states and 95 transitions. [2019-01-14 04:37:19,725 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:37:19,725 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 95 transitions. [2019-01-14 04:37:19,727 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2019-01-14 04:37:19,727 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:37:19,727 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:37:19,727 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 04:37:19,728 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:37:19,729 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 [2019-01-14 04:37:19,729 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 [2019-01-14 04:37:19,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:19,729 INFO L82 PathProgramCache]: Analyzing trace with hash 28692807, now seen corresponding path program 1 times [2019-01-14 04:37:19,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:19,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:19,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:19,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:19,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:19,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:19,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:19,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:19,794 INFO L82 PathProgramCache]: Analyzing trace with hash -852169887, now seen corresponding path program 2 times [2019-01-14 04:37:19,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:19,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:19,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:19,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:19,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:19,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:19,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:19,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:19,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:37:19,884 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:37:19,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:37:19,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:37:19,886 INFO L87 Difference]: Start difference. First operand 68 states and 95 transitions. cyclomatic complexity: 28 Second operand 5 states. [2019-01-14 04:37:20,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:37:20,101 INFO L93 Difference]: Finished difference Result 134 states and 185 transitions. [2019-01-14 04:37:20,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 04:37:20,105 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 185 transitions. [2019-01-14 04:37:20,109 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 129 [2019-01-14 04:37:20,111 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 134 states and 185 transitions. [2019-01-14 04:37:20,111 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 134 [2019-01-14 04:37:20,112 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 134 [2019-01-14 04:37:20,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 185 transitions. [2019-01-14 04:37:20,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:37:20,114 INFO L706 BuchiCegarLoop]: Abstraction has 134 states and 185 transitions. [2019-01-14 04:37:20,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states and 185 transitions. [2019-01-14 04:37:20,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 71. [2019-01-14 04:37:20,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-14 04:37:20,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 98 transitions. [2019-01-14 04:37:20,123 INFO L729 BuchiCegarLoop]: Abstraction has 71 states and 98 transitions. [2019-01-14 04:37:20,123 INFO L609 BuchiCegarLoop]: Abstraction has 71 states and 98 transitions. [2019-01-14 04:37:20,123 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:37:20,123 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 98 transitions. [2019-01-14 04:37:20,125 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2019-01-14 04:37:20,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:37:20,125 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:37:20,126 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 04:37:20,127 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:37:20,127 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 [2019-01-14 04:37:20,128 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 [2019-01-14 04:37:20,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:20,128 INFO L82 PathProgramCache]: Analyzing trace with hash 28692807, now seen corresponding path program 2 times [2019-01-14 04:37:20,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:20,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:20,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:20,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:37:20,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:20,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:20,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:20,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:20,152 INFO L82 PathProgramCache]: Analyzing trace with hash 6171900, now seen corresponding path program 1 times [2019-01-14 04:37:20,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:20,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:20,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:20,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:37:20,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:20,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:20,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:20,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:20,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:37:20,225 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:37:20,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:37:20,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:37:20,225 INFO L87 Difference]: Start difference. First operand 71 states and 98 transitions. cyclomatic complexity: 28 Second operand 3 states. [2019-01-14 04:37:20,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:37:20,372 INFO L93 Difference]: Finished difference Result 116 states and 156 transitions. [2019-01-14 04:37:20,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:37:20,374 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 156 transitions. [2019-01-14 04:37:20,376 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 109 [2019-01-14 04:37:20,378 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 116 states and 156 transitions. [2019-01-14 04:37:20,378 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2019-01-14 04:37:20,379 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2019-01-14 04:37:20,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 156 transitions. [2019-01-14 04:37:20,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:37:20,381 INFO L706 BuchiCegarLoop]: Abstraction has 116 states and 156 transitions. [2019-01-14 04:37:20,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 156 transitions. [2019-01-14 04:37:20,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 99. [2019-01-14 04:37:20,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-14 04:37:20,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 132 transitions. [2019-01-14 04:37:20,392 INFO L729 BuchiCegarLoop]: Abstraction has 99 states and 132 transitions. [2019-01-14 04:37:20,392 INFO L609 BuchiCegarLoop]: Abstraction has 99 states and 132 transitions. [2019-01-14 04:37:20,392 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 04:37:20,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 132 transitions. [2019-01-14 04:37:20,395 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2019-01-14 04:37:20,395 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:37:20,395 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:37:20,397 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:37:20,397 INFO L868 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] [2019-01-14 04:37:20,398 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 [2019-01-14 04:37:20,398 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 [2019-01-14 04:37:20,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:20,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1803984585, now seen corresponding path program 1 times [2019-01-14 04:37:20,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:20,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:20,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:20,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:20,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:20,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:20,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:20,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:20,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1836630604, now seen corresponding path program 1 times [2019-01-14 04:37:20,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:20,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:20,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:20,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:20,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:20,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:20,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:20,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:20,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:37:20,453 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:37:20,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:37:20,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:37:20,454 INFO L87 Difference]: Start difference. First operand 99 states and 132 transitions. cyclomatic complexity: 34 Second operand 3 states. [2019-01-14 04:37:20,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:37:20,513 INFO L93 Difference]: Finished difference Result 116 states and 154 transitions. [2019-01-14 04:37:20,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:37:20,516 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 154 transitions. [2019-01-14 04:37:20,518 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 109 [2019-01-14 04:37:20,519 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 116 states and 154 transitions. [2019-01-14 04:37:20,520 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2019-01-14 04:37:20,520 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2019-01-14 04:37:20,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 154 transitions. [2019-01-14 04:37:20,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:37:20,521 INFO L706 BuchiCegarLoop]: Abstraction has 116 states and 154 transitions. [2019-01-14 04:37:20,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 154 transitions. [2019-01-14 04:37:20,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 99. [2019-01-14 04:37:20,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-14 04:37:20,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 130 transitions. [2019-01-14 04:37:20,529 INFO L729 BuchiCegarLoop]: Abstraction has 99 states and 130 transitions. [2019-01-14 04:37:20,530 INFO L609 BuchiCegarLoop]: Abstraction has 99 states and 130 transitions. [2019-01-14 04:37:20,530 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 04:37:20,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 130 transitions. [2019-01-14 04:37:20,532 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2019-01-14 04:37:20,532 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:37:20,532 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:37:20,533 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:37:20,534 INFO L868 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] [2019-01-14 04:37:20,535 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 [2019-01-14 04:37:20,535 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 [2019-01-14 04:37:20,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:20,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1803984585, now seen corresponding path program 2 times [2019-01-14 04:37:20,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:20,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:20,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:20,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:20,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:20,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:20,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:20,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:20,560 INFO L82 PathProgramCache]: Analyzing trace with hash 331104409, now seen corresponding path program 1 times [2019-01-14 04:37:20,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:20,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:20,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:20,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:37:20,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:20,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:20,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:20,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:20,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:37:20,628 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:37:20,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:37:20,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:37:20,629 INFO L87 Difference]: Start difference. First operand 99 states and 130 transitions. cyclomatic complexity: 32 Second operand 3 states. [2019-01-14 04:37:20,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:37:20,715 INFO L93 Difference]: Finished difference Result 125 states and 159 transitions. [2019-01-14 04:37:20,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:37:20,717 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 159 transitions. [2019-01-14 04:37:20,720 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 108 [2019-01-14 04:37:20,722 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 125 states and 159 transitions. [2019-01-14 04:37:20,722 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2019-01-14 04:37:20,723 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2019-01-14 04:37:20,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 159 transitions. [2019-01-14 04:37:20,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:37:20,725 INFO L706 BuchiCegarLoop]: Abstraction has 125 states and 159 transitions. [2019-01-14 04:37:20,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 159 transitions. [2019-01-14 04:37:20,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-01-14 04:37:20,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-01-14 04:37:20,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 159 transitions. [2019-01-14 04:37:20,740 INFO L729 BuchiCegarLoop]: Abstraction has 125 states and 159 transitions. [2019-01-14 04:37:20,740 INFO L609 BuchiCegarLoop]: Abstraction has 125 states and 159 transitions. [2019-01-14 04:37:20,740 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 04:37:20,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 159 transitions. [2019-01-14 04:37:20,743 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 108 [2019-01-14 04:37:20,744 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:37:20,744 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:37:20,744 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:37:20,745 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:37:20,745 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 [2019-01-14 04:37:20,745 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 [2019-01-14 04:37:20,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:20,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1783039958, now seen corresponding path program 1 times [2019-01-14 04:37:20,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:20,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:20,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:20,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:20,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:20,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:20,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:20,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:20,801 INFO L82 PathProgramCache]: Analyzing trace with hash -62972986, now seen corresponding path program 1 times [2019-01-14 04:37:20,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:20,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:20,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:20,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:20,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:20,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:21,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:21,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:21,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:37:21,046 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:37:21,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:37:21,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:37:21,046 INFO L87 Difference]: Start difference. First operand 125 states and 159 transitions. cyclomatic complexity: 36 Second operand 5 states. [2019-01-14 04:37:21,332 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-14 04:37:21,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:37:21,780 INFO L93 Difference]: Finished difference Result 275 states and 346 transitions. [2019-01-14 04:37:21,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 04:37:21,783 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 275 states and 346 transitions. [2019-01-14 04:37:21,787 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 255 [2019-01-14 04:37:21,789 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 275 states to 275 states and 346 transitions. [2019-01-14 04:37:21,790 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 275 [2019-01-14 04:37:21,790 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 275 [2019-01-14 04:37:21,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 275 states and 346 transitions. [2019-01-14 04:37:21,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:37:21,791 INFO L706 BuchiCegarLoop]: Abstraction has 275 states and 346 transitions. [2019-01-14 04:37:21,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states and 346 transitions. [2019-01-14 04:37:21,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 134. [2019-01-14 04:37:21,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-01-14 04:37:21,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 167 transitions. [2019-01-14 04:37:21,801 INFO L729 BuchiCegarLoop]: Abstraction has 134 states and 167 transitions. [2019-01-14 04:37:21,801 INFO L609 BuchiCegarLoop]: Abstraction has 134 states and 167 transitions. [2019-01-14 04:37:21,801 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 04:37:21,801 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 134 states and 167 transitions. [2019-01-14 04:37:21,804 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 117 [2019-01-14 04:37:21,804 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:37:21,804 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:37:21,805 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:37:21,805 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:37:21,806 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 [2019-01-14 04:37:21,806 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 [2019-01-14 04:37:21,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:21,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1783039958, now seen corresponding path program 2 times [2019-01-14 04:37:21,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:21,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:21,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:21,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:21,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:21,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:21,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:21,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:21,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1078264795, now seen corresponding path program 1 times [2019-01-14 04:37:21,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:21,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:21,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:21,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:37:21,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:21,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:21,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:21,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:21,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1917816028, now seen corresponding path program 1 times [2019-01-14 04:37:21,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:21,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:21,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:21,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:21,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:21,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:21,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:21,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:21,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:37:22,058 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-01-14 04:37:22,177 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:37:22,178 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:37:22,179 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:37:22,179 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:37:22,179 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:37:22,179 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:37:22,179 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:37:22,180 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:37:22,180 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1_false-unreach-call_false-termination.cil.c_Iteration8_Loop [2019-01-14 04:37:22,180 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:37:22,180 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:37:22,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:22,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:22,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:22,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:22,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:22,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:22,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:22,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:22,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:22,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:22,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:22,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:22,606 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:37:22,607 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 04:37:22,625 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:22,625 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:37:22,639 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:37:22,640 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 04:37:22,675 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:22,675 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:37:22,684 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:37:22,685 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:37:22,730 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:22,731 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 04:37:22,875 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:37:22,876 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:37:22,920 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:37:22,922 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:37:22,922 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:37:22,923 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:37:22,923 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:37:22,923 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:37:22,923 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:37:22,923 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:37:22,923 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:37:22,923 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1_false-unreach-call_false-termination.cil.c_Iteration8_Loop [2019-01-14 04:37:22,924 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:37:22,924 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:37:22,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:22,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:22,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:22,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:22,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:22,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:22,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:22,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:22,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:22,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:22,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:23,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:23,441 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-14 04:37:23,632 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:37:23,637 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:37:23,638 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:23,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:23,640 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:23,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:23,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:23,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:23,643 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:23,644 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:23,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:23,647 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:23,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:23,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:23,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:23,648 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:23,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:23,651 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:23,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:23,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:23,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:23,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:23,656 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:23,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:23,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:23,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:23,661 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:23,661 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:23,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:23,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:23,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:23,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:23,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:23,665 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:23,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:23,666 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:23,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:23,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:23,671 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:23,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:23,672 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:23,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:23,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:23,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:23,675 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:23,676 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:23,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:23,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:23,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:23,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:23,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:23,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:23,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:23,679 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:23,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:23,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:23,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:23,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:23,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:23,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:23,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:23,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:23,690 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:23,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:23,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:23,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:23,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:23,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:23,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:23,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:23,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:23,698 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:23,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:23,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:23,705 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:23,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:23,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:23,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:23,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:23,706 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:23,707 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:23,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:23,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:23,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:23,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:23,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:23,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:23,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:23,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:23,718 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:23,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:23,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:23,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 [2019-01-14 04:37:23,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:23,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:23,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:23,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:23,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:23,723 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:23,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:23,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:23,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:23,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:23,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:23,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:23,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:23,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:23,735 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:23,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:23,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:23,739 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-14 04:37:23,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:23,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:23,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:23,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:23,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:23,741 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:23,742 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:23,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:23,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:23,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 [2019-01-14 04:37:23,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:23,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:23,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:23,750 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:23,753 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:23,754 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:23,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:23,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:23,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:23,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:23,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:23,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:23,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:23,766 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:23,767 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:23,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:23,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:23,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 [2019-01-14 04:37:23,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:23,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:23,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:23,773 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:23,774 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:23,774 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:23,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:23,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:23,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 [2019-01-14 04:37:23,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:23,781 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:23,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:23,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:23,781 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:23,782 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:23,782 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:23,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:23,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:23,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:23,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:23,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:23,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:23,791 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:23,792 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:23,792 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:23,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:23,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:23,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:23,797 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:23,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:23,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:23,798 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:23,802 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:23,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:23,807 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:23,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 [2019-01-14 04:37:23,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:23,808 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:23,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:23,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:23,812 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:23,813 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:23,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:23,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:23,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:23,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:23,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:23,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:23,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:23,819 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:23,820 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:23,820 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:23,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:23,825 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:23,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:23,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:23,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:23,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:23,829 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:23,830 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:23,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:23,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:23,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 [2019-01-14 04:37:23,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:23,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:23,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:23,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:23,837 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:23,841 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:23,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:23,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:23,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 [2019-01-14 04:37:23,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:23,845 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:23,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:23,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:23,849 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:23,850 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:23,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:23,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:23,854 INFO L497 LassoAnalysis]: Using template '3-nested'. [2019-01-14 04:37:23,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 [2019-01-14 04:37:23,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:23,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:23,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:23,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:23,859 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:23,860 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:23,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:23,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:23,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:23,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:23,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:23,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:23,865 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:23,865 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:23,867 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 04:37:23,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:23,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:23,879 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:23,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:23,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:23,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:23,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:23,880 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:23,881 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:23,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:23,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:23,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 [2019-01-14 04:37:23,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:23,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:23,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:23,891 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:23,891 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:23,904 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 04:37:23,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:23,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:23,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:23,911 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:23,911 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:23,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:23,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:23,912 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:23,914 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:23,914 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:23,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:23,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:23,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:23,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:23,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:23,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:23,925 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:23,925 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:23,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:23,929 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:23,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:23,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:23,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:23,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:23,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:23,936 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:23,938 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:23,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:23,949 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:23,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 [2019-01-14 04:37:23,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:23,950 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:23,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:23,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:23,951 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:23,952 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:23,952 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:23,956 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:23,956 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:23,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:23,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:23,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:23,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:23,959 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:23,959 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:23,960 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:23,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:23,962 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:23,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:23,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:23,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:23,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:23,964 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:23,964 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:23,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:23,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:23,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 [2019-01-14 04:37:23,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:23,973 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:23,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:23,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:23,974 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:23,975 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:23,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:23,977 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:23,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 [2019-01-14 04:37:23,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:23,980 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:23,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:23,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:23,981 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:23,982 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:23,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:23,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:23,984 INFO L497 LassoAnalysis]: Using template '4-nested'. [2019-01-14 04:37:23,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:23,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:23,985 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:23,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:23,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:23,986 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:23,986 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:23,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:23,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:23,992 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:23,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:23,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:23,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:23,993 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:23,993 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:23,996 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 04:37:23,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:24,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,010 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:24,011 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:24,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,013 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:24,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,016 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:24,016 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:24,017 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 04:37:24,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,019 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,019 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:24,020 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,021 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:24,021 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:24,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,023 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:24,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,025 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:24,026 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:24,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,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 [2019-01-14 04:37:24,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:24,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,029 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:24,031 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:24,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:24,049 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,051 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:24,052 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:24,052 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:24,058 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,059 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,059 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:24,060 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:24,060 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,062 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:24,063 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,063 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:24,064 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:24,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,070 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:24,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,070 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:24,071 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:24,071 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,075 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:24,076 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,076 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:24,078 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:24,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,080 INFO L497 LassoAnalysis]: Using template '2-phase'. [2019-01-14 04:37:24,080 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,081 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,081 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:24,081 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,082 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:24,083 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:24,083 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,086 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,086 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,087 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:24,087 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,087 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:24,087 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:24,088 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:24,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,100 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,100 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,101 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,102 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:24,103 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,103 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:24,104 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:24,104 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,108 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,110 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,111 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:24,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,111 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:24,111 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:24,114 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:24,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,116 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,116 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:24,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,119 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:24,120 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:24,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,122 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,122 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,122 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:24,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,123 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:24,124 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:24,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,126 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,126 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:24,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,127 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:24,135 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:24,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,146 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,147 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:24,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,148 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:24,149 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:24,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,154 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,155 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,155 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:24,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,156 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:24,157 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:24,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,159 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,160 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:24,160 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,160 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:24,161 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:24,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,174 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,175 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:24,175 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,176 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:24,177 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:24,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,179 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,180 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:24,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,180 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:24,182 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:24,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,184 INFO L497 LassoAnalysis]: Using template '3-phase'. [2019-01-14 04:37:24,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,185 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,186 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:24,186 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,186 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:24,187 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:24,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,190 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,191 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,191 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:24,191 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,191 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:24,192 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:24,195 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 04:37:24,196 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,217 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,222 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,222 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:24,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,223 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:24,229 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:24,229 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,239 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,242 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,245 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:24,246 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,246 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:24,246 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:24,248 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 04:37:24,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,254 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,255 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:24,255 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,255 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:24,262 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:24,262 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,266 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,266 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:24,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,267 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:24,268 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:24,268 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,271 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,271 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:24,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,272 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:24,273 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:24,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,291 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,291 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:24,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,292 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:24,293 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:24,293 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,301 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,301 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:24,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,302 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:24,302 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:24,303 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,305 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,309 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,309 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:24,309 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,310 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:24,360 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:24,360 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,377 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,377 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:24,377 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,378 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:24,383 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:24,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,387 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,387 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:24,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,388 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:24,389 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:24,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,392 INFO L497 LassoAnalysis]: Using template '4-phase'. [2019-01-14 04:37:24,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,393 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,393 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:24,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,394 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:24,395 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:24,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,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 [2019-01-14 04:37:24,401 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,401 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:24,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,402 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:24,402 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:24,410 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 04:37:24,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,433 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,437 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,438 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:24,438 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,438 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:24,439 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:24,440 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,451 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,451 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,456 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,456 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:24,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,456 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:24,456 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:24,462 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 04:37:24,462 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,465 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,465 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,466 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:24,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,471 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:24,472 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:24,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,476 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,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 [2019-01-14 04:37:24,478 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,478 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:24,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,479 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:24,482 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:24,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,488 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,488 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:24,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,488 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:24,494 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:24,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,530 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,530 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:24,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,531 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:24,536 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:24,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,545 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,546 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:24,549 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,550 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:24,551 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:24,551 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,557 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,558 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,558 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:24,558 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,559 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:24,563 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:24,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,588 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,593 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,593 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:24,593 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,593 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:24,598 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:24,598 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,602 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,602 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,602 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:24,602 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,606 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:24,608 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:24,608 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,613 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,613 INFO L497 LassoAnalysis]: Using template '2-lex'. [2019-01-14 04:37:24,614 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,614 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,614 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:24,614 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,615 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:24,615 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:24,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,627 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,627 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,627 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:24,628 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,628 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:24,628 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:24,629 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 04:37:24,629 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,651 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,652 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,652 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:24,652 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,653 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:24,653 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:24,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,657 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,658 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,658 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:24,658 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,659 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:24,659 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:24,659 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 04:37:24,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,662 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,663 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:24,663 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,663 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:24,664 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:24,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,668 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,668 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:24,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,669 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:24,670 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:24,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,673 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,673 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,673 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:24,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,674 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:24,675 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:24,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,690 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,691 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:24,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,692 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:24,693 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:24,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,698 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,698 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:24,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,698 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:24,699 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:24,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,711 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,711 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:24,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,712 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:24,713 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:24,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,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 [2019-01-14 04:37:24,727 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,728 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:24,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,728 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:24,732 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:24,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,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 [2019-01-14 04:37:24,740 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,740 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:24,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,740 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:24,744 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:24,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,753 INFO L497 LassoAnalysis]: Using template '3-lex'. [2019-01-14 04:37:24,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 [2019-01-14 04:37:24,757 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,757 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:24,757 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,758 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:24,759 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:24,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,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 [2019-01-14 04:37:24,771 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,771 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:24,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,771 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:24,771 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:24,776 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 04:37:24,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,811 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,811 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:24,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,812 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:24,813 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:24,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,818 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,819 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,819 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:24,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,819 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:24,819 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:24,820 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 04:37:24,820 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,824 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,825 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:24,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,825 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:24,826 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:24,826 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,832 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,832 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:24,832 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,832 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:24,833 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:24,833 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,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 [2019-01-14 04:37:24,838 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,839 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:24,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,839 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:24,840 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:24,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,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 [2019-01-14 04:37:24,862 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,862 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:24,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,862 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:24,863 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:24,864 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,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 [2019-01-14 04:37:24,869 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,869 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:24,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,870 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:24,871 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:24,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,875 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,875 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,875 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:24,875 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,877 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:24,877 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:24,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,883 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,884 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,884 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:24,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,885 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:24,886 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:24,886 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,892 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:24,895 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:24,895 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:24,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:24,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:24,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:24,896 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:24,897 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:24,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:24,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:24,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:37:24,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:37:24,917 INFO L87 Difference]: Start difference. First operand 134 states and 167 transitions. cyclomatic complexity: 35 Second operand 3 states. [2019-01-14 04:37:25,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:37:25,169 INFO L93 Difference]: Finished difference Result 220 states and 270 transitions. [2019-01-14 04:37:25,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:37:25,170 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 220 states and 270 transitions. [2019-01-14 04:37:25,172 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 201 [2019-01-14 04:37:25,176 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 220 states to 220 states and 270 transitions. [2019-01-14 04:37:25,176 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 220 [2019-01-14 04:37:25,176 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 220 [2019-01-14 04:37:25,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 220 states and 270 transitions. [2019-01-14 04:37:25,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:37:25,177 INFO L706 BuchiCegarLoop]: Abstraction has 220 states and 270 transitions. [2019-01-14 04:37:25,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states and 270 transitions. [2019-01-14 04:37:25,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2019-01-14 04:37:25,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-01-14 04:37:25,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 270 transitions. [2019-01-14 04:37:25,195 INFO L729 BuchiCegarLoop]: Abstraction has 220 states and 270 transitions. [2019-01-14 04:37:25,195 INFO L609 BuchiCegarLoop]: Abstraction has 220 states and 270 transitions. [2019-01-14 04:37:25,195 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-14 04:37:25,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 220 states and 270 transitions. [2019-01-14 04:37:25,200 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 201 [2019-01-14 04:37:25,200 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:37:25,200 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:37:25,201 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:37:25,201 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:37:25,201 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 [2019-01-14 04:37:25,201 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 [2019-01-14 04:37:25,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:25,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1783039958, now seen corresponding path program 3 times [2019-01-14 04:37:25,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:25,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:25,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:25,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:25,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:25,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:25,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:25,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:25,225 INFO L82 PathProgramCache]: Analyzing trace with hash -872319612, now seen corresponding path program 1 times [2019-01-14 04:37:25,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:25,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:25,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:25,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:37:25,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:25,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:25,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:25,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:25,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:37:25,344 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:37:25,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:37:25,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:37:25,345 INFO L87 Difference]: Start difference. First operand 220 states and 270 transitions. cyclomatic complexity: 54 Second operand 5 states. [2019-01-14 04:37:25,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:37:25,493 INFO L93 Difference]: Finished difference Result 428 states and 517 transitions. [2019-01-14 04:37:25,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 04:37:25,494 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 428 states and 517 transitions. [2019-01-14 04:37:25,498 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 387 [2019-01-14 04:37:25,503 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 428 states to 428 states and 517 transitions. [2019-01-14 04:37:25,504 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 428 [2019-01-14 04:37:25,504 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 428 [2019-01-14 04:37:25,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 428 states and 517 transitions. [2019-01-14 04:37:25,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:37:25,505 INFO L706 BuchiCegarLoop]: Abstraction has 428 states and 517 transitions. [2019-01-14 04:37:25,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states and 517 transitions. [2019-01-14 04:37:25,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 229. [2019-01-14 04:37:25,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-01-14 04:37:25,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 275 transitions. [2019-01-14 04:37:25,516 INFO L729 BuchiCegarLoop]: Abstraction has 229 states and 275 transitions. [2019-01-14 04:37:25,516 INFO L609 BuchiCegarLoop]: Abstraction has 229 states and 275 transitions. [2019-01-14 04:37:25,516 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-14 04:37:25,517 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 229 states and 275 transitions. [2019-01-14 04:37:25,518 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 210 [2019-01-14 04:37:25,518 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:37:25,518 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:37:25,519 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:37:25,519 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:37:25,520 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 [2019-01-14 04:37:25,520 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 [2019-01-14 04:37:25,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:25,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1783039958, now seen corresponding path program 4 times [2019-01-14 04:37:25,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:25,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:25,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:25,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:25,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:25,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:25,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:25,532 INFO L82 PathProgramCache]: Analyzing trace with hash -872319550, now seen corresponding path program 1 times [2019-01-14 04:37:25,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:25,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:25,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:25,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:37:25,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:25,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:25,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:25,540 INFO L82 PathProgramCache]: Analyzing trace with hash 2123761273, now seen corresponding path program 1 times [2019-01-14 04:37:25,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:25,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:25,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:25,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:25,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:25,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:25,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:26,383 WARN L181 SmtUtils]: Spent 825.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-01-14 04:37:26,632 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-14 04:37:26,651 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:37:26,651 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:37:26,651 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:37:26,651 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:37:26,651 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:37:26,651 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:37:26,652 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:37:26,652 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:37:26,652 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1_false-unreach-call_false-termination.cil.c_Iteration10_Loop [2019-01-14 04:37:26,652 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:37:26,652 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:37:26,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:26,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:26,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:26,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:26,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:26,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:26,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:27,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:27,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:27,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:27,391 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-14 04:37:27,552 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-14 04:37:27,777 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-14 04:37:27,948 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:37:27,949 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 04:37:27,956 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:27,957 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:37:27,964 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:37:27,965 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 04:37:27,989 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:27,989 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:37:27,992 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:37:27,992 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 04:37:28,017 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:28,018 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 04:37:28,072 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:37:28,072 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:37:28,110 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:37:28,112 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:37:28,112 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:37:28,112 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:37:28,112 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:37:28,113 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:37:28,113 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:37:28,113 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:37:28,113 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:37:28,113 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1_false-unreach-call_false-termination.cil.c_Iteration10_Loop [2019-01-14 04:37:28,113 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:37:28,113 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:37:28,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:28,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:28,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:28,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:28,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:28,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:28,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:28,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:28,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:28,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:28,358 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:37:28,358 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:37:28,359 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:28,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:28,361 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:28,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,362 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:28,363 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:28,364 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:28,364 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,364 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,365 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:28,365 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,365 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:28,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:28,366 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:28,366 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:28,369 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:28,370 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:28,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:28,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:28,372 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:28,372 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,373 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:28,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:28,375 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:28,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:28,377 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:28,378 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:28,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:28,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,380 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:28,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:28,380 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:28,380 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:28,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:28,383 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:28,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,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 [2019-01-14 04:37:28,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:28,385 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,385 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:28,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:28,386 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:28,386 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,386 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-14 04:37:28,387 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:28,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,388 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:28,388 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:28,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,389 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,389 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:28,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,390 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:28,390 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:28,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:28,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,392 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:28,392 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:28,392 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:28,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:28,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,396 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:28,397 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:28,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:28,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,399 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:28,400 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:28,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:28,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,402 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:28,402 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:28,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,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 [2019-01-14 04:37:28,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:28,404 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,404 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:28,405 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:28,405 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,406 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,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 [2019-01-14 04:37:28,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:28,407 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,407 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:28,407 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:28,407 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:28,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:28,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,409 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:28,409 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:28,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,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 [2019-01-14 04:37:28,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:28,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,412 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:28,412 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:28,413 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:28,413 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,413 INFO L497 LassoAnalysis]: Using template '3-nested'. [2019-01-14 04:37:28,419 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,419 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:28,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,420 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:28,420 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:28,420 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:28,426 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,426 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:28,426 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:28,427 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,427 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,431 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:28,431 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,432 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:28,432 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:28,432 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 04:37:28,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,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 [2019-01-14 04:37:28,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:28,436 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,436 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:28,441 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:28,441 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,442 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,442 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:28,443 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,443 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:28,449 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:28,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,450 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:28,451 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,451 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:28,452 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:28,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,453 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:28,454 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,457 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:28,458 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:28,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,459 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,460 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:28,464 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,464 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:28,464 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:28,465 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 04:37:28,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,468 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:28,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,472 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:28,472 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:28,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,474 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:28,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,478 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:28,479 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:28,479 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 04:37:28,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,481 INFO L497 LassoAnalysis]: Using template '4-nested'. [2019-01-14 04:37:28,482 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:28,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,483 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:28,483 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:28,483 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:28,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,491 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:28,491 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:28,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,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 [2019-01-14 04:37:28,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:28,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,496 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:28,496 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:28,500 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 04:37:28,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,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 [2019-01-14 04:37:28,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:28,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,508 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:28,511 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:28,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,516 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:28,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,517 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:28,517 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:28,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:28,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,522 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:28,522 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:28,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:28,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,527 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:28,527 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:28,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,532 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:28,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,536 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:28,536 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:28,537 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 04:37:28,537 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:28,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,543 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:28,543 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:28,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,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 [2019-01-14 04:37:28,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:28,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,550 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:28,550 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:28,551 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 04:37:28,551 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,552 INFO L497 LassoAnalysis]: Using template '2-phase'. [2019-01-14 04:37:28,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 [2019-01-14 04:37:28,552 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:28,553 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:28,557 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,557 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:28,558 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:28,558 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,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 [2019-01-14 04:37:28,562 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:28,562 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:28,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,567 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:28,567 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:28,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,569 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:28,569 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:28,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,570 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:28,570 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:28,571 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:28,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,583 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:28,583 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:28,583 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,583 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:28,584 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:28,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,589 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,590 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:28,593 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:28,593 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,594 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:28,594 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:28,594 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,597 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,597 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:28,597 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:28,597 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,598 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:28,602 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:28,603 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,604 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,610 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:28,610 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:28,610 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,611 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,611 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:28,611 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:28,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,618 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,618 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:28,619 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:28,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,621 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:28,621 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:28,622 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:28,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,628 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,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 [2019-01-14 04:37:28,633 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:28,633 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:28,633 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,633 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:28,634 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:37:28,634 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,641 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:28,641 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:28,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,645 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:28,645 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:37:28,646 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:28,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,652 INFO L497 LassoAnalysis]: Using template '3-phase'. [2019-01-14 04:37:28,655 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,655 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:28,656 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:28,656 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,656 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:28,657 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:28,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,662 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:28,663 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:28,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,666 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:28,667 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:28,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,672 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,673 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:28,673 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:28,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,674 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:28,674 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:28,678 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 04:37:28,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,695 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:28,695 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:28,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,695 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:28,696 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:28,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,705 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,705 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:28,705 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:28,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,706 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:28,709 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:28,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,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 [2019-01-14 04:37:28,716 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:28,716 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:28,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,717 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:28,718 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:28,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,726 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:28,726 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:28,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,729 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:28,730 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:28,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,734 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:28,734 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:28,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,735 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:28,735 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:28,736 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 04:37:28,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,741 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:28,741 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:28,741 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,741 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:28,742 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:28,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,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 [2019-01-14 04:37:28,749 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:28,749 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 04:37:28,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,750 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:28,750 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:28,751 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 04:37:28,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,754 INFO L497 LassoAnalysis]: Using template '4-phase'. [2019-01-14 04:37:28,754 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,755 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:28,755 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:28,755 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,756 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:28,757 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:28,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,758 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:28,758 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:28,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,759 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:28,760 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:28,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,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 [2019-01-14 04:37:28,762 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:28,762 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:28,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,762 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:28,762 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:28,764 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 04:37:28,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,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 [2019-01-14 04:37:28,775 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:28,775 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:28,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,775 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:28,777 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:28,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,780 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:28,780 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:28,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,780 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:28,782 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:28,782 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,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 [2019-01-14 04:37:28,784 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:28,784 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:28,784 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,785 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:28,786 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:28,786 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,789 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:28,789 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:28,789 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,789 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:28,790 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:28,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,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 [2019-01-14 04:37:28,796 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:28,797 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:28,797 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,797 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:28,797 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:28,799 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 04:37:28,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,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 [2019-01-14 04:37:28,816 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:28,816 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:28,816 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,816 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:28,817 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 04:37:28,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,840 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,843 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:28,843 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:28,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,844 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:28,844 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 04:37:28,845 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 04:37:28,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,863 INFO L497 LassoAnalysis]: Using template '2-lex'. [2019-01-14 04:37:28,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,868 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:28,868 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:28,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,868 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:28,869 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:28,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,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 [2019-01-14 04:37:28,873 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:28,874 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:28,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,877 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:28,877 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:28,877 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,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 [2019-01-14 04:37:28,880 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:28,880 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:28,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,881 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:28,884 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:28,885 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 04:37:28,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,894 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:28,894 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:28,894 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,894 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:28,895 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:28,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,900 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,900 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:28,900 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:28,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,901 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:28,901 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:28,902 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,906 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:28,906 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:28,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,907 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:28,907 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:28,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,911 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,911 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:28,912 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:28,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,912 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:28,913 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:28,913 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,916 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,917 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:28,917 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:28,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,917 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:28,917 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:28,918 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 04:37:28,918 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,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 [2019-01-14 04:37:28,921 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:28,921 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:28,921 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,922 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:28,922 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:37:28,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,926 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,926 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:28,926 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 04:37:28,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,927 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:28,927 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 04:37:28,927 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 04:37:28,928 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,930 INFO L497 LassoAnalysis]: Using template '3-lex'. [2019-01-14 04:37:28,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,931 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:28,931 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:28,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,932 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:28,932 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:28,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,940 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,940 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:28,941 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:28,941 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,941 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:28,942 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:28,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,945 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,950 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:28,950 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:28,951 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,951 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:28,951 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:28,952 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 04:37:28,952 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,970 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,971 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:28,974 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:28,974 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,975 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,975 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:28,976 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:28,976 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:28,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:28,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:28,995 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:28,998 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:28,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:28,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:28,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:28,999 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:29,000 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:29,000 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:29,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:29,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:29,015 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:29,015 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:29,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:29,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:29,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:29,020 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:29,021 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:29,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:29,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:29,036 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:29,039 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:29,040 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:29,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:29,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:29,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:29,040 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:29,041 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:29,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:29,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:29,054 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:29,055 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:29,055 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:29,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:29,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:29,055 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:29,056 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:29,057 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 04:37:29,057 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:29,071 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:29,071 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:29,072 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:29,072 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:29,072 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:29,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:29,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:29,073 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:29,074 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:29,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:29,080 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:29,081 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:29,081 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 04:37:29,081 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 04:37:29,081 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:29,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:29,082 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:29,082 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 04:37:29,083 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 04:37:29,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:29,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:30,060 WARN L181 SmtUtils]: Spent 967.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2019-01-14 04:37:30,130 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:37:30,131 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:37:30,131 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:37:30,131 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:37:30,131 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:37:30,131 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:37:30,131 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:37:30,131 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:37:30,132 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1_false-unreach-call_false-termination.cil.c_Iteration10_Lasso [2019-01-14 04:37:30,132 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:37:30,132 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:37:30,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:30,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:30,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:30,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:30,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:30,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:30,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:30,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:30,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:30,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:30,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:30,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:30,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:30,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:30,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:30,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:30,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:30,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:30,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:30,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:30,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:30,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:30,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:30,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:30,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:30,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:30,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:30,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,130 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:37:31,130 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 04:37:31,138 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:31,138 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:37:31,141 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:37:31,141 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 04:37:31,163 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:31,163 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:37:31,167 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:37:31,167 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 04:37:31,189 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:31,189 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:37:31,198 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:37:31,198 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 04:37:31,220 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:37:31,221 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 04:37:31,254 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:37:31,254 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:37:31,283 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:37:31,285 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:37:31,285 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:37:31,285 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:37:31,285 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:37:31,285 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:37:31,285 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:37:31,285 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:37:31,286 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:37:31,286 INFO L131 ssoRankerPreferences]: Filename of dumped script: pc_sfifo_1_false-unreach-call_false-termination.cil.c_Iteration10_Lasso [2019-01-14 04:37:31,286 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:37:31,286 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:37:31,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:31,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:37:32,088 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:37:32,088 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:37:32,089 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:32,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:32,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:32,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:32,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:32,097 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:32,097 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:37:32,104 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:32,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:32,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:32,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:32,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:32,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:32,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:32,106 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:32,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:32,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:32,106 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:32,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:32,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:37:32,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:32,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:32,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:32,114 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:37:32,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:37:32,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:32,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:32,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:32,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:32,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:37:32,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:32,118 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:37:32,118 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:37:32,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:37:32,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:37:32,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:37:32,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:37:32,129 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:37:32,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:37:32,134 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-01-14 04:37:32,134 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 04:37:32,154 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:37:32,176 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 04:37:32,177 INFO L444 ModelExtractionUtils]: 6 out of 11 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:37:32,181 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:37:32,182 INFO L440 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2019-01-14 04:37:32,183 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:37:32,184 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~q_free~0) = 1*~q_free~0 Supporting invariants [1*~q_free~0 >= 0] [2019-01-14 04:37:32,222 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-14 04:37:32,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:32,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:32,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:37:33,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:33,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:37:33,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:33,563 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 [2019-01-14 04:37:33,564 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 229 states and 275 transitions. cyclomatic complexity: 50 Second operand 6 states. [2019-01-14 04:37:34,045 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. [2019-01-14 04:37:34,047 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 [2019-01-14 04:37:34,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 04:37:34,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 340 transitions. [2019-01-14 04:37:34,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 340 transitions. Stem has 16 letters. Loop has 15 letters. [2019-01-14 04:37:34,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:37:34,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 340 transitions. Stem has 31 letters. Loop has 15 letters. [2019-01-14 04:37:34,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:37:34,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 340 transitions. Stem has 16 letters. Loop has 30 letters. [2019-01-14 04:37:34,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:37:34,062 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1087 states and 1324 transitions. [2019-01-14 04:37:34,073 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 563 [2019-01-14 04:37:34,079 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1087 states to 892 states and 1084 transitions. [2019-01-14 04:37:34,080 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 646 [2019-01-14 04:37:34,081 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 650 [2019-01-14 04:37:34,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 892 states and 1084 transitions. [2019-01-14 04:37:34,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:37:34,081 INFO L706 BuchiCegarLoop]: Abstraction has 892 states and 1084 transitions. [2019-01-14 04:37:34,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states and 1084 transitions. [2019-01-14 04:37:34,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 659. [2019-01-14 04:37:34,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-01-14 04:37:34,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 802 transitions. [2019-01-14 04:37:34,096 INFO L729 BuchiCegarLoop]: Abstraction has 659 states and 802 transitions. [2019-01-14 04:37:34,096 INFO L609 BuchiCegarLoop]: Abstraction has 659 states and 802 transitions. [2019-01-14 04:37:34,096 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-14 04:37:34,097 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 659 states and 802 transitions. [2019-01-14 04:37:34,101 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 377 [2019-01-14 04:37:34,101 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:37:34,101 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:37:34,102 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:37:34,102 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:37:34,102 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 [2019-01-14 04:37:34,102 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 [2019-01-14 04:37:34,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:34,102 INFO L82 PathProgramCache]: Analyzing trace with hash 560336285, now seen corresponding path program 1 times [2019-01-14 04:37:34,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:34,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:34,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:34,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:34,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:34,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:34,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:34,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:34,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:37:34,157 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:37:34,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:34,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1691430829, now seen corresponding path program 1 times [2019-01-14 04:37:34,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:34,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:34,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:34,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:34,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:34,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:34,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:34,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:34,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-14 04:37:34,233 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:37:34,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:37:34,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:37:34,237 INFO L87 Difference]: Start difference. First operand 659 states and 802 transitions. cyclomatic complexity: 155 Second operand 3 states. [2019-01-14 04:37:34,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:37:34,300 INFO L93 Difference]: Finished difference Result 372 states and 445 transitions. [2019-01-14 04:37:34,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:37:34,304 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 372 states and 445 transitions. [2019-01-14 04:37:34,309 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 233 [2019-01-14 04:37:34,314 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 372 states to 314 states and 376 transitions. [2019-01-14 04:37:34,314 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 311 [2019-01-14 04:37:34,315 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 314 [2019-01-14 04:37:34,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 314 states and 376 transitions. [2019-01-14 04:37:34,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:37:34,315 INFO L706 BuchiCegarLoop]: Abstraction has 314 states and 376 transitions. [2019-01-14 04:37:34,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states and 376 transitions. [2019-01-14 04:37:34,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 249. [2019-01-14 04:37:34,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-01-14 04:37:34,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 301 transitions. [2019-01-14 04:37:34,329 INFO L729 BuchiCegarLoop]: Abstraction has 249 states and 301 transitions. [2019-01-14 04:37:34,330 INFO L609 BuchiCegarLoop]: Abstraction has 249 states and 301 transitions. [2019-01-14 04:37:34,330 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-14 04:37:34,330 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 249 states and 301 transitions. [2019-01-14 04:37:34,337 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 206 [2019-01-14 04:37:34,337 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:37:34,337 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:37:34,338 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:37:34,338 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:37:34,338 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 [2019-01-14 04:37:34,338 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 [2019-01-14 04:37:34,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:34,342 INFO L82 PathProgramCache]: Analyzing trace with hash 190554158, now seen corresponding path program 1 times [2019-01-14 04:37:34,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:34,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:34,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:34,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:34,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:34,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:34,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:34,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:34,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 04:37:34,415 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:37:34,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:34,415 INFO L82 PathProgramCache]: Analyzing trace with hash 313858188, now seen corresponding path program 1 times [2019-01-14 04:37:34,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:34,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:34,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:34,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:34,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:34,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:34,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:34,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:34,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 04:37:34,470 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:37:34,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:37:34,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:37:34,476 INFO L87 Difference]: Start difference. First operand 249 states and 301 transitions. cyclomatic complexity: 54 Second operand 3 states. [2019-01-14 04:37:34,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:37:34,665 INFO L93 Difference]: Finished difference Result 308 states and 364 transitions. [2019-01-14 04:37:34,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:37:34,668 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 308 states and 364 transitions. [2019-01-14 04:37:34,674 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 258 [2019-01-14 04:37:34,679 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 308 states to 308 states and 364 transitions. [2019-01-14 04:37:34,680 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 308 [2019-01-14 04:37:34,680 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 308 [2019-01-14 04:37:34,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 308 states and 364 transitions. [2019-01-14 04:37:34,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:37:34,686 INFO L706 BuchiCegarLoop]: Abstraction has 308 states and 364 transitions. [2019-01-14 04:37:34,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states and 364 transitions. [2019-01-14 04:37:34,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 218. [2019-01-14 04:37:34,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-01-14 04:37:34,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 258 transitions. [2019-01-14 04:37:34,698 INFO L729 BuchiCegarLoop]: Abstraction has 218 states and 258 transitions. [2019-01-14 04:37:34,698 INFO L609 BuchiCegarLoop]: Abstraction has 218 states and 258 transitions. [2019-01-14 04:37:34,698 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2019-01-14 04:37:34,699 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 218 states and 258 transitions. [2019-01-14 04:37:34,703 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 168 [2019-01-14 04:37:34,704 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:37:34,704 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:37:34,704 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:37:34,705 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:37:34,705 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 [2019-01-14 04:37:34,705 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 [2019-01-14 04:37:34,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:34,705 INFO L82 PathProgramCache]: Analyzing trace with hash 190554158, now seen corresponding path program 2 times [2019-01-14 04:37:34,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:34,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:34,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:34,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:34,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:34,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:34,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:34,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:34,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 04:37:34,794 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:37:34,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:34,798 INFO L82 PathProgramCache]: Analyzing trace with hash -750519281, now seen corresponding path program 1 times [2019-01-14 04:37:34,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:34,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:34,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:34,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:37:34,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:34,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:34,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:35,262 WARN L181 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2019-01-14 04:37:35,463 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-14 04:37:35,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:37:35,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:37:35,479 INFO L87 Difference]: Start difference. First operand 218 states and 258 transitions. cyclomatic complexity: 43 Second operand 3 states. [2019-01-14 04:37:35,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:37:35,591 INFO L93 Difference]: Finished difference Result 241 states and 282 transitions. [2019-01-14 04:37:35,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:37:35,595 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 241 states and 282 transitions. [2019-01-14 04:37:35,601 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 190 [2019-01-14 04:37:35,606 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 241 states to 240 states and 281 transitions. [2019-01-14 04:37:35,607 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 240 [2019-01-14 04:37:35,608 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 240 [2019-01-14 04:37:35,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 240 states and 281 transitions. [2019-01-14 04:37:35,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:37:35,612 INFO L706 BuchiCegarLoop]: Abstraction has 240 states and 281 transitions. [2019-01-14 04:37:35,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states and 281 transitions. [2019-01-14 04:37:35,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 217. [2019-01-14 04:37:35,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-01-14 04:37:35,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 256 transitions. [2019-01-14 04:37:35,625 INFO L729 BuchiCegarLoop]: Abstraction has 217 states and 256 transitions. [2019-01-14 04:37:35,626 INFO L609 BuchiCegarLoop]: Abstraction has 217 states and 256 transitions. [2019-01-14 04:37:35,626 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2019-01-14 04:37:35,626 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 217 states and 256 transitions. [2019-01-14 04:37:35,631 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 168 [2019-01-14 04:37:35,632 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:37:35,634 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:37:35,635 INFO L867 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] [2019-01-14 04:37:35,635 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:37:35,637 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 [2019-01-14 04:37:35,637 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 [2019-01-14 04:37:35,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:35,638 INFO L82 PathProgramCache]: Analyzing trace with hash -2034026126, now seen corresponding path program 1 times [2019-01-14 04:37:35,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:35,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:35,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:35,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:35,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:35,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:37:35,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:37:35,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:37:35,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:37:35,708 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:37:35,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:35,709 INFO L82 PathProgramCache]: Analyzing trace with hash -750519281, now seen corresponding path program 2 times [2019-01-14 04:37:35,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:35,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:35,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:35,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:35,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:35,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:35,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:35,974 WARN L181 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2019-01-14 04:37:35,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:37:35,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:37:35,989 INFO L87 Difference]: Start difference. First operand 217 states and 256 transitions. cyclomatic complexity: 42 Second operand 3 states. [2019-01-14 04:37:36,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:37:36,015 INFO L93 Difference]: Finished difference Result 210 states and 244 transitions. [2019-01-14 04:37:36,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:37:36,015 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 210 states and 244 transitions. [2019-01-14 04:37:36,018 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 168 [2019-01-14 04:37:36,020 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 210 states to 210 states and 244 transitions. [2019-01-14 04:37:36,020 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 210 [2019-01-14 04:37:36,020 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 210 [2019-01-14 04:37:36,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 210 states and 244 transitions. [2019-01-14 04:37:36,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:37:36,021 INFO L706 BuchiCegarLoop]: Abstraction has 210 states and 244 transitions. [2019-01-14 04:37:36,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states and 244 transitions. [2019-01-14 04:37:36,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2019-01-14 04:37:36,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-01-14 04:37:36,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 244 transitions. [2019-01-14 04:37:36,025 INFO L729 BuchiCegarLoop]: Abstraction has 210 states and 244 transitions. [2019-01-14 04:37:36,025 INFO L609 BuchiCegarLoop]: Abstraction has 210 states and 244 transitions. [2019-01-14 04:37:36,026 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2019-01-14 04:37:36,026 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 210 states and 244 transitions. [2019-01-14 04:37:36,027 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 168 [2019-01-14 04:37:36,027 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:37:36,027 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:37:36,028 INFO L867 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] [2019-01-14 04:37:36,028 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:37:36,028 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 [2019-01-14 04:37:36,028 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 [2019-01-14 04:37:36,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:36,029 INFO L82 PathProgramCache]: Analyzing trace with hash 825120445, now seen corresponding path program 1 times [2019-01-14 04:37:36,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:36,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:36,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:36,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:37:36,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:36,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:36,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:36,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:36,044 INFO L82 PathProgramCache]: Analyzing trace with hash -750519281, now seen corresponding path program 3 times [2019-01-14 04:37:36,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:36,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:36,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:36,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:37:36,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:36,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:36,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:36,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:37:36,050 INFO L82 PathProgramCache]: Analyzing trace with hash 250746827, now seen corresponding path program 1 times [2019-01-14 04:37:36,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:37:36,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:37:36,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:36,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:37:36,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:37:36,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:36,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:37:36,190 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2019-01-14 04:37:36,539 WARN L181 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 103 [2019-01-14 04:37:36,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:37:36 BoogieIcfgContainer [2019-01-14 04:37:36,634 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:37:36,634 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:37:36,634 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:37:36,634 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:37:36,635 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:37:18" (3/4) ... [2019-01-14 04:37:36,644 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-14 04:37:36,714 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 04:37:36,715 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:37:36,716 INFO L168 Benchmark]: Toolchain (without parser) took 19407.26 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 272.1 MB). Free memory was 952.7 MB in the beginning and 894.0 MB in the end (delta: 58.7 MB). Peak memory consumption was 330.8 MB. Max. memory is 11.5 GB. [2019-01-14 04:37:36,719 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:37:36,720 INFO L168 Benchmark]: CACSL2BoogieTranslator took 507.80 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 940.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-01-14 04:37:36,720 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.78 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 04:37:36,721 INFO L168 Benchmark]: Boogie Preprocessor took 153.75 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.5 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -149.8 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-01-14 04:37:36,721 INFO L168 Benchmark]: RCFGBuilder took 834.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:37:36,728 INFO L168 Benchmark]: BuchiAutomizer took 17750.34 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 174.6 MB). Free memory was 1.1 GB in the beginning and 894.0 MB in the end (delta: 164.4 MB). Peak memory consumption was 339.0 MB. Max. memory is 11.5 GB. [2019-01-14 04:37:36,729 INFO L168 Benchmark]: Witness Printer took 80.55 ms. Allocated memory is still 1.3 GB. Free memory was 894.0 MB in the beginning and 894.0 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-01-14 04:37:36,739 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 507.80 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 940.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 72.78 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 153.75 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.5 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -149.8 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 834.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 17750.34 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 174.6 MB). Free memory was 1.1 GB in the beginning and 894.0 MB in the end (delta: 164.4 MB). Peak memory consumption was 339.0 MB. Max. memory is 11.5 GB. * Witness Printer took 80.55 ms. Allocated memory is still 1.3 GB. Free memory was 894.0 MB in the beginning and 894.0 MB in the end (delta: 24 B). Peak memory consumption was 24 B. 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 17.6s and 15 iterations. TraceHistogramMax:2. Analysis of lassos took 13.1s. Construction of modules took 1.6s. Büchi inclusion checks took 2.3s. Highest rank in rank-based complementation 3. Minimization of det autom 11. Minimization of nondet autom 3. Automata minimization 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 848 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.1s 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, 1.6s 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: 57ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s - 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@7915ac95=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@7a159d12=0, p_dw_pc=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@f468dd=0, tmp=0, q_free=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6e6e246a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@25023a7e=0, __retres1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3d980285=0, p_dw_st=2, \result=0, tmp___0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@14fd35f5=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...